How to perform right circular rotation of an array?

Algorithm

1. Declare and initialize an array.
2. Variable n will denote the number of times an array should be rotated toward its right.
3. 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].
4. The last element of the array will become the first element of the rotated array

Program In Java

class RotateRight {  
    
    public static void main(String[] args) {  
          
        //Initialize array   
        int [] arr = new int [] {1, 2, 3, 4, 5};   
        //n determine the number of times an array should be rotated.  
        int n = 3;  
          
        //Displays original array  
        System.out.println("Original array: ");  
        for (int i = 0; i < arr.length; i++) {   
            System.out.print(arr[i] + " ");   
        }    
          
        //Rotate the given array by n times toward right  
        for(int i = 0; i < n; i++){  
            int j, last;  
            //Stores the last element of array  
            last = arr[arr.length-1];  
          
            for(j = arr.length-1; j > 0; j--){  
                //Shift element of array by one  
                arr[j] = arr[j-1];  
            }  
            //Last element of array will be added to the start of array.  
            arr[0] = last;  
        }  
      
        System.out.println();  
          
        //Displays resulting array after rotation  
        System.out.println("Array after right rotation: ");  
        for(int i = 0; i< arr.length; i++){  
            System.out.print(arr[i] + " ");  
        }  
    }  
}  

Output :

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

 

Program In C#

using System;  
                      
public class RotateRight  
{  
    public static void Main()  
    {  
        //Initialize array   
        int [] arr = new int [] {1, 2, 3, 4, 5};   
        //n determine the number of times an array should be rotated.  
        int n = 3;  
          
        //Displays original array  
        Console.WriteLine("Original array: ");  
        for (int i = 0; i < arr.Length; i++) {   
            Console.Write(arr[i] + " ");   
        }    
          
        //Rotate the given array by n times toward right  
        for(int i = 0; i < n; i++){  
            int j, last;  
            //Stores the last element of array  
            last = arr[arr.Length-1];  
          
            for(j = arr.Length-1; j > 0; j--){  
                //Shift element of array by one  
                arr[j] = arr[j-1];  
            }  
            //Last element of array will be added to the start of array.  
            arr[0] = last;  
        }  
      
        Console.WriteLine();  
          
        //Displays resulting array after rotation  
        Console.WriteLine("Array after right rotation: ");  
        for(int i = 0; i< arr.Length; i++){  
            Console.Write(arr[i] + " ");  
        }  
    }  
}  

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