-
Notifications
You must be signed in to change notification settings - Fork 0
/
shell-sort.c
48 lines (36 loc) · 943 Bytes
/
shell-sort.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include <stdio.h>
#define MAX 7
int a[MAX] = {10,9,8,7,6,5,4};
void sort(){
int valueToInsert, inner,outer, interval = 1, elements = MAX;
while( interval <= (elements/3))
{
interval = (interval * 3) + 1;
}
while(interval > 0)
{
for(outer = interval; outer < MAX; outer++)
{
valueToInsert = a[outer];
inner = outer;
while( inner > (interval - 1) && a[inner - interval] > valueToInsert)
{
a[inner] = a[inner - interval];
inner -= interval;
}
if(inner!=outer)
a[inner] = valueToInsert;
}
interval = (interval-1)/3;
}
}
int main() {
int i;
printf("List before sorting\n");
for(i = 0; i < MAX; i++)
printf("%d ", a[i]);
sort();
printf("\nList after sorting\n");
for(i = 0; i < MAX; i++)
printf("%d ", a[i]);
}