diff --git a/cpp/insertion sort implementation b/cpp/insertion sort implementation
new file mode 100644
index 0000000..c1d495d
--- /dev/null
+++ b/cpp/insertion sort implementation	
@@ -0,0 +1,34 @@
+#include <bits/stdc++.h>
+using namespace std;
+void insertionSort(int arr[], int n)
+{
+    int i, key, j;
+    for (i = 1; i < n; i++)
+    {
+        key = arr[i];
+        j = i - 1;
+        while (j >= 0 && arr[j] > key)
+        {
+            arr[j + 1] = arr[j];
+            j = j - 1;
+        }
+        arr[j + 1] = key;
+    }
+}
+void printArray(int arr[], int n)
+{
+    int i;
+    for (i = 0; i < n; i++)
+        cout << arr[i] << " ";
+    cout << endl;
+}
+int main()
+{
+    int arr[] = { 12, 11, 13, 5, 6 };
+    int N = sizeof(arr) / sizeof(arr[0]);
+ 
+    insertionSort(arr, N);
+    printArray(arr, N);
+ 
+    return 0;
+}