Java: Cyclically rotate a given array clockwise by one

Last update on May 09 2025 12:51:34 (UTC/GMT +8 hours)

45. Rotate an array clockwise by one position

Write a Java program to cyclically rotate a given array clockwise by one.

Pictorial Presentation:

Sample Solution:

Java Code:

// Import the Arrays class to use the toString method for array display.
import java.util.Arrays;

// Define the Main class.
public class Main
{
    // Define an integer array named 'arra'.
    static int arra[] = new int[]{10, 20, 30, 40, 50, 60};

    // Define a method to rotate the array elements.
    static void rotate_array()
    {
        // Store the last element of the array in variable 'a'.
        int a = arra[arra.length - 1];
        int i;

        // Iterate through the array to shift elements to the right.
        for (i = arra.length - 1; i > 0; i--)
            arra[i] = arra[i - 1];

        // Set the first element of the array to 'a' (rotating it to the end).
        arra[0] = a;
    }

    // The main method for executing the program.
    public static void main(String[] args)
    {
        // Display the original array.
        System.out.println("Original array:");
        System.out.println(Arrays.toString(arra));

        // Call the rotate_array method to rotate the array.
        rotate_array();

        // Display the rotated array.
        System.out.println("Rotated array:");
        System.out.println(Arrays.toString(arra));
    }
}

Sample Output:

                                                                              
Original arraay:
[10, 20, 30, 40, 50, 60]
Rotated arraay:
[60, 10, 20, 30, 40, 50]

Flowchart:

For more Practice: Solve these Related Problems:

• Write a Java program to cyclically rotate an array counterclockwise by one.
• Write a Java program to rotate an array by a given number of positions without using extra space.
• Write a Java program to find the minimum number of rotations required to sort a rotated sorted array.
• Write a Java program to check if one array is a rotated version of another.

Go to:

• Java Array Exercises Home ↩
• Java Exercises Home ↩

PREV : Count possible triangles from an unsorted array.
NEXT : Check for pair with a specified sum in rotated array.

Java Code Editor: