diff options
Diffstat (limited to 'insertsort.c')
| -rw-r--r-- | insertsort.c | 38 |
1 files changed, 0 insertions, 38 deletions
diff --git a/insertsort.c b/insertsort.c deleted file mode 100644 index 1a30a1a..0000000 --- a/insertsort.c +++ /dev/null | |||
| @@ -1,38 +0,0 @@ | |||
| 1 | #include <stdio.h> | ||
| 2 | #include <stdlib.h> | ||
| 3 | #include <time.h> | ||
| 4 | |||
| 5 | #include "util.h" | ||
| 6 | |||
| 7 | typedef int T; | ||
| 8 | |||
| 9 | void | ||
| 10 | insertsort(T a[], size_t n) | ||
| 11 | { | ||
| 12 | for ( size_t i = 1; i < n; ++i ) { | ||
| 13 | size_t j = i; | ||
| 14 | const T value = a[i]; | ||
| 15 | |||
| 16 | for ( ; j > 0 && a[j - 1] > value; --j ) | ||
| 17 | a[j] = a[j - 1]; | ||
| 18 | |||
| 19 | a[j] = value; | ||
| 20 | } | ||
| 21 | } | ||
| 22 | |||
| 23 | int | ||
| 24 | main(void) | ||
| 25 | { | ||
| 26 | T a[10]; | ||
| 27 | |||
| 28 | srand(time(NULL)); | ||
| 29 | for ( size_t i = 0; i != NELEM(a); ++i ) | ||
| 30 | a[i] = rand() % 100; | ||
| 31 | |||
| 32 | insertsort(a, NELEM(a)); | ||
| 33 | |||
| 34 | for ( size_t i = 0; i != NELEM(a); ++i ) | ||
| 35 | printf("%d ", a[i]); | ||
| 36 | putchar('\n'); | ||
| 37 | return EXIT_SUCCESS; | ||
| 38 | } | ||
