/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 vote292 views7 answers
Hexo
C++
0 vote265 views1 answer
Upcasting in c++
C++
-2 votes251 views1 answer
Uses of c++
C++
0 vote338 views1 answer
Dijkstra algorithm in c++ geeksforgeeks
C++
5 votes264 views2 answers
Conditional operator in cpp
C++
9 votes271 views4 answers
Print vector of vector c++
C++
2 votes276 views1 answer
Set was not declared in this scope
C++
0 vote240 views1 answer
Destin'y child
C++
0 vote265 views1 answer
Apply pca to dataframe
C++
0 vote270 views1 answer
C++ compile to exe
C++