# Java Program to right rotate the elements of an array

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.

Consider the 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

• STEP 1: START
• STEP 2: INITIALIZE arr[] ={1, 2, 3, 4, 5 }.
• STEP 3: SET n =3
• STEP 4: PRINT “Original Array”
• STEP 5: REPEAT STEP 6 UNTIL i<arr.length
//for(i=0; i<arr.length; i++)
• STEP 6: PRINT arr[i]
• STEP 7: REPEAT STEP 8 to STEP 12 UNTIL i<n
// for(i=0; i<n; i++ )
• STEP 8: DEFINE j, last.
• STEP 9: last = arr[arr.length-1]
• STEP 10: REPEAT STEP 11 UNTIL j>0
//for(j= arr.length-1;j>0; j–)
• STEP 11: arr[j]= arr[j-1]
• STEP 12: arr= last
• STEP 13: PRINT “Array after right rotation”
• STEP 14: REPEAT STEP 15 UNTIL i<arr.length
//for(i=0; i<arr.length; i++)
• STEP 15: PRINT arr[i]
• STEP 16: END

### Program:

1. class RotateRight {
2.  public static void main(String[] args) {
3.         //Initialize array
4.         int [] arr = new int [] {1, 2, 3, 4, 5};
5.         //n determine the number of times an array should be rotated.
6.         int n = 3;
7.
8.         //Displays original array
9.         System.out.println(“Original array: “);
10.         for (int i = 0; i < arr.length; i++) {
11.             System.out.print(arr[i] + ” “);
12.         }
13.
14.         //Rotate the given array by n times toward right
15.         for(int i = 0; i < n; i++){
16.             int j, last;
17.             //Stores the last element of array
18.             last = arr[arr.length-1];
19.
20.             for(j = arr.length-1; j > 0; j–){
21.                 //Shift element of array by one
22.                 arr[j] = arr[j-1];
23.             }
24.             //Last element of array will be added to the start of array.
25.             arr = last;
26.         }
27.
28.         System.out.println();
29.
30.         //Displays resulting array after rotation
31.         System.out.println(“Array after right rotation: “);
32.         for(int i = 0; i< arr.length; i++){
33.             System.out.print(arr[i] + ” “);
34.         }
35.     }
36. }

Output:

```Original Array:
1   2   3   4   5
Array after right rotation:
3   4   5   1   2```