In this tutorial you will learn about the Shell Sort Algorithm and its application with practical example.
Shell Sort Program In 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 |
#include<stdio.h> void ShellSort(int a[], int n) { int i, j, ctr, tmp; for(ctr = n/2; ctr > 0; ctr /= 2) { for(i = ctr; i < n; i++) { tmp = a[i]; for(j = i; j >= ctr; j -= ctr) { if(tmp < a[j-ctr]) a[j] = a[j-ctr]; else break; } a[j] = tmp; } } } int main() { int i, n, a[10]; printf("Enter number of elements: "); scanf("%d",&n); printf("Enter %d integer numbers\n", n); for(i = 0; i < n; i++) { scanf("%d",&a[i]); } ShellSort(a,n); printf("Elements after sorting: "); for(i = 0; i < n; i++) printf("%d ",a[i]); printf("\n"); return 0; } |
Output:-