From 6dfb84e47f1e087c58065fa1cdb1ab9af7ce7018 Mon Sep 17 00:00:00 2001 From: Natan Elia <natanelia7@gmail.com> Date: Fri, 12 Feb 2016 18:04:59 +0700 Subject: [PATCH] Insertion Sort upload --- insertion_sort.c | 29 ++++++++++++++++++----------- 1 file changed, 18 insertions(+), 11 deletions(-) diff --git a/insertion_sort.c b/insertion_sort.c index 42d8677..694b832 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 -- GitLab