diff --git a/cpp/insertion_sort.cpp b/cpp/insertion_sort.cpp
index 99212f1..0089f73 100644
--- a/cpp/insertion_sort.cpp
+++ b/cpp/insertion_sort.cpp
@@ -1,27 +1,30 @@
-#include <bits/stdc++.h>
-using namespace std;
+#include <cstdio>
+#include <cstdlib>
 
-void insSort(vector<int> &a){
-    int j,n=a.size(),k;
-    for(int i=1;i<n;i++){
-        k=a[i],j=i-1;
-        while(j>=0 && a[j]>k){
-            a[j+1]=a[j];
-            j--;
-        }
-        a[j+1]=k;
-    }
+void insertionSort(int arr[], int length) {
+      int i, j, tmp;
+      for (i = 1; i < length; i++) {
+            j = i;
+            while (j > 0 && arr[j - 1] > arr[j]) {
+                  tmp = arr[j];
+                  arr[j] = arr[j - 1];
+                  arr[j - 1] = tmp;
+                  j--;
+            }
+      }
 }
 
-int main() {
-	int n,e;
-	vector<int> a;
-	cout<<"Enter length of array: ";
-	cin>>n;
-	cout<<"Enter elements in array\n";
-	for(int i=0;i<n;i++) cin>>e,a.emplace_back(e);
-	insSort(a);
-	cout<<"Sorted array is: ";
-	for(int i=0;i<n;i++) cout<<a[i]<<" ";
-	return 0;
-}
\ No newline at end of file
+int displayArray( int arr[], int length ) {
+    printf("{");
+    for( int i=0; i<length; i++ )
+        printf("%d, ", arr[i] );
+    printf("}\n");
+}
+
+int main( int argc, char* argv[] )
+{
+    int array[10] = { 2,1,7,4,3,5,9,6,8,0 };
+    size_t length = sizeof(array)/sizeof(int);
+    displayArray( array, length ); 
+    insertionSort( array, length );
+    displayArray( array, length );