In this tutorial you will learn about the Cocktail Sort Algorithm and its application with practical example.
Cocktail 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 39 40 41 42 43 44 45 46 47 48 49 50 51 52 |
#include <stdio.h> int temp; void cocktail_sort(int a[], int n) { int is_swapped = 1; int begin = 0,i; int end = n - 1; while (is_swapped) { is_swapped = 0; for (i = begin; i < end; ++i) { if (a[i] > a[i + 1]) { temp = a[i]; a[i]=a[i+1]; a[i+1]=temp; is_swapped = 1; } } if (!is_swapped) break; is_swapped = 0; for (i = end - 1; i >= begin; --i) { if (a[i] > a[i + 1]) { temp = a[i]; a[i]=a[i+1]; a[i+1]=temp; is_swapped = 1; } } ++begin; } } 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]); } cocktail_sort(a, n); printf("Elements after sorting: "); for (i = 0; i < n; i++) printf("%d ", a[i]); printf("\n"); return 0; } |
Output:-
