/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 vote266 views1 answer
How to make a substring after certain position
C++
0 vote265 views1 answer
Why we use iostream in C++ programming
C++
0 vote245 views1 answer
Zero fill in c++
C++
0 vote267 views1 answer
C++ fstream read line write ,creat file program
C++
0 vote243 views1 answer
C++ if else if
C++
5 votes261 views1 answer
How to include everything in c++
C++
0 vote256 views2 answers
Or in c++
C++
1 vote281 views1 answer
Fibonacci series in c++ Recursive
C++
0 vote270 views1 answer
Cudamemcpy
C++
0 vote242 views10 answers
Convert java code to c++ online
C++