Create Reversal_Algorithm

This is the code for reversal algorithm applied to the 1-D array.
Here, we have to rotate the array to the right by k steps. It is the optimised solution for rotating the array.

Author: AvwalKaur

Reversal_Algorithm

@@ -0,0 +1,31 @@
+package Algo;
+
+public class Reversal_Algorithm {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		int []arr= {1,2,3,4,5,6,7};
+        int k=3;
+        RotateArray(arr,k);
+        for(int i=0;i<arr.length;i++) {
+        	System.out.print(arr[i]+" ");
+        }
+	}
+	public static void RotateArray(int []arr,int k) {
+    	int n=arr.length;
+    	k=k%n;
+    	Reverse(arr,0,n-1);
+    	Reverse(arr,0,k-1);
+    	Reverse(arr,k,n-1);
+	}
+	public static void Reverse(int []arr,int i,int j) {
+		while(i<j) {
+			int temp=arr[i];
+			arr[i]=arr[j];
+			arr[j]=temp;
+			i++;
+			j--;
+		}
+    }
+
+}