diff --git a/Arrays/ReversalAlgorthmForArrayRotation.cpp b/Arrays/ReversalAlgorthmForArrayRotation.cpp
new file mode 100644
index 0000000..7cdf261
--- /dev/null
+++ b/Arrays/ReversalAlgorthmForArrayRotation.cpp
@@ -0,0 +1,51 @@
+// C++ program for reversal algorithm 
+// of array rotation 
+#include <bits/stdc++.h> 
+using namespace std; 
+
+/*Function to reverse arr[] from index start to end*/
+void rvereseArray(int arr[], int start, int end) 
+{ 
+	while (start < end) { 
+		int temp = arr[start]; 
+		arr[start] = arr[end]; 
+		arr[end] = temp; 
+		start++; 
+		end--; 
+	} 
+} 
+
+/* Function to left rotate arr[] of size n by d */
+void leftRotate(int arr[], int d, int n) 
+{ 
+	if (d == 0) 
+		return; 
+	rvereseArray(arr, 0, d - 1); 
+	rvereseArray(arr, d, n - 1); 
+	rvereseArray(arr, 0, n - 1); 
+} 
+
+// Function to print an array 
+void printArray(int arr[], int size) 
+{ 
+	for (int i = 0; i < size; i++) 
+		cout << arr[i] << " "; 
+} 
+
+/* Driver program to test above functions */
+int main() 
+{ 
+	int arr[] = { 1, 2, 3, 4, 5, 6, 7 }; 
+	int n = sizeof(arr) / sizeof(arr[0]); 
+	int d = 2; 
+
+	// in case the rotating factor is 
+	// greater than array length 
+	d = d % n; 
+
+	// Function calling 
+	leftRotate(arr, d, n); 
+	printArray(arr, n); 
+
+	return 0; 
+}