Array Data Structure
Program in java rotate arrays in Both sides
package Arrays;
public class ArrayRotate1DS {
public static void main(String[] args) {
int a[] = new int[] { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
System.out.println(“Before\n”);
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + “ “);
}
int n = 2256;
if (a.length <= n) {
System.out.println(“N:=” + n);
n = n % a.length;
System.out.println(“N:= -” + n);
}
for (int i = 0; i < n; i++) {
int first = a[0];
for (int j = 0; j < a.length — 1; j++) {
a[j] = a[j + 1];
}
a[a.length — 1] = first;
System.out.println(“\nLeft Rotate:” + (i + 1));
for (int k = 0; k < a.length; k++) {
System.out.print(a[k] + “ “);
}
}
System.out.println(“\n — — — — — — — — — — \n”);
for (int i = 0; i < n; i++) {
int last = a[a.length — 1];
for (int j = a.length — 1; j > 0; j — ) {
a[j] = a[j — 1];
}
a[0] = last;
System.out.println(“\n Right Rotate:” + (i + 1));
for (int k = 0; k < a.length; k++) {
System.out.print(a[k] + “ “);
}
}
System.out.println(“\nAfter\n”);
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + “ “);
}
}
}
