FilesExpand file tree

 master

/

shellsort.c

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

49 lines (43 loc) · 1.04 KB

 master

/

shellsort.c

Copy path

Top

File metadata and controls

• Code
• Blame

49 lines (43 loc) · 1.04 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

49

#include <stdio.h>

/* Shell's method - a generalized insertion sort

For more info, visit https://www.tutorialspoint.com/data_structures_algorithms/shell_sort_algorithm.htm */

void shell_sort(int *a, int n)

{

int i, j, gap, temp;

/* Assess the array in gaps starting at half the array size - Each gap is a sublist of 2 values */

for(gap = n/2 ; gap > 0 ; gap /= 2)

{

/* Index at the right value of each gap */

for(i = gap ; i < n ; i++)

{

/* Take a copy of the value under inspection */

temp = a[i];

for(j = i ; j >= gap ; j-= gap)

{

/* Compare the values in the sub lists and swap where necessary */

if(temp < a[j-gap])

a[j] = a[j-gap];

else

break;

}

a[j] = temp;

}

}

}

int main(void)

{

int i;

int a[10] = { 5 , 211 , 66 , 7 , 12 , 2, 76 , 134 , 99 , 9 };

printf("In: ")

for(i = 0 ; i < 10 ; i++)

{

printf("%d ", a[i]);

}

shell_sort(a, 10);

printf("\nOut: ")

for(i = 0 ; i < 10 ; i++)

{

printf("%d ", a[i]);

}

return 0;

}