diff --git a/insertion_sort.c b/insertion_sort.c
index 42d867717853c978fe58487e2e9ebe415a834f64..694b832961ed1619a0e2a75d5554f93621b19f18 100644
--- a/insertion_sort.c
+++ b/insertion_sort.c
@@ -2,18 +2,22 @@
 /* insertion sort ascending order */
  
 #include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+#define MAX 10000
  
-int main()
+int main(int argc, char** argv)
 {
-  int n, array[1000], c, d, t;
- 
-  printf("Enter number of elements\n");
-  scanf("%d", &n);
- 
-  printf("Enter %d integers\n", n);
- 
+  int n, c, d, t;
+  clock_t begin, end;
+  begin = clock();
+
+  n = atoi(argv[1]);
+  int* array = (int *)malloc(sizeof(int) * n);
+
+  srand(time(NULL));
   for (c = 0; c < n; c++) {
-    scanf("%d", &array[c]);
+      array[c] = rand()%MAX; 
   }
  
   for (c = 1 ; c <= n - 1; c++) {
@@ -28,11 +32,14 @@ int main()
     }
   }
  
-  printf("Sorted list in ascending order:\n");
+/*  printf("Sorted list in ascending order:\n");
  
   for (c = 0; c <= n - 1; c++) {
     printf("%d\n", array[c]);
-  }
+  }*/
+
+  end = clock();
+  printf("Time Spent: %F\n",(double)(end-begin)/CLOCKS_PER_SEC);
  
   return 0;
 }
\ No newline at end of file