/C++/Rotate an array of n elements to the right by k steps

Rotate an array of n elements to the right by k steps

public void rotate(int[] nums, int k) {
        k %= nums.length;
        reverse(nums, 0, nums.length - 1);
        reverse(nums, 0, k - 1);
        reverse(nums, k, nums.length - 1);
    }
    public void reverse(int[] nums, int start, int end) {
        while (start < end) {
            int temp = nums[start];
            nums[start] = nums[end];
            nums[end] = temp;
            start++;
            end--;
        }
    }

Source: massivealgorithms.blogspot.com

Similar codes

0 vote280 views1 answer
C++ descending sort
C++
0 vote274 views1 answer
Balanced brackets in c++
C++
0 vote269 views1 answer
UPARAM(ref)
C++
0 vote274 views1 answer
Cuda locks
C++
0 vote297 views1 answer
Inbuilt function for bin to dec in c++
C++
0 vote279 views1 answer
One dimensiol array to two dimen c++
C++
0 vote306 views1 answer
Fill 2-dimensional array with value
C++
3 votes278 views2 answers
A+b+c whole square
C++
19 votes286 views5 answers
When kotlin
C++
4 votes221 views2 answers
Escape sequence in c++
C++