Explanation
In this program, we need to rotate the elements of array towards its right by the specified number of times. An array is said to be right rotated if all elements of the array are moved to its right by one position. One approach is to loop through the array by shifting each element of the array to its next position. The last element of the array will become the first element of the rotated array.
![](https://nerdutella.com/assets/dropzone/uploads/tinymce_images/questions/36400/mceu_25156590411667950139564.png)
Consider above array, if n is 1 then, all elements of the array will be moved to its right by one position that is the first element of the array will take the second position, the second element will be moved to the third position and so on. The last element of the array will become the first element of the array.
Algorithm
- Declare and initialize an array.
- Variable n will denote the number of times an array should be rotated toward its right.
- The array can be right rotated by shifting its elements to a position next to them which can be accomplished by looping through the array in reverse order (loop will start from the length of the array -1 to 0) and perform the operation arr[j] = arr[j-1].
- The last element of the array will become the first element of the rotated array.
Input:
arr = [1, 2, 3, 4, 5]
Here, n determine the number of times an array should be rotated
n = 3
Output:
Original array: 1 2 3 4 5
Array after right rotation: 3 4 5 1 2
Python
Output:
C
Output:
JAVA
Output:
C#
Output:
PHP
Output: