CockTail Sort in C - Sanfoundry

This C Program implements cocktail sort. Cocktail sort is a variation of bubble sort that is both a stable sorting algorithm and a comparison sort. The algorithm differs from a bubble sort in that it sorts in both directions on each pass through the list. This sorting algorithm is only marginally more difficult to implement than a bubble sort, and solves the problem of turtles in bubble sorts.
The various names of cocktail sort are bidirectional bubble sort, cocktail shaker sort, shaker sort , ripple sort, shuffle sort, shuttle sort or happy hour sort

Here is source code of the C Program to implement cocktail sort. The C program is successfully compiled and run on a Linux system. The program output is also shown below.

```
/*
```

 * C Program to Implement CockTail Sort

```
 */
```
```
#include <stdio.h>
```
```
#define MAX 8
```
```
 
```
```
int main()
```
```
{
```
```
    int data[MAX];
```
```
    int i, j, n, c;
```
```
 
```
```
    printf("\nEnter the data");
```
```
    for (i = 0; i < MAX; i++)
```
```
    {
```
```
        scanf("%d", &data[i]);
```
```
    }
```
```
    n = MAX;    
```
```
    do
```
```
    {
```
```
        /*
```

          * Rightward pass will shift the largest element to its correct place at the end

```
         */
```
```
        for (i = 0;  i < n - 1; i++)
```
```
        {
```
```
            if (data[i] > data[i + 1])
```
```
            {
```

                data[i] = data[i] + data[i + 1];

                data[i + 1] = data[i] - data[i + 1];

                data[i] = data[i] - data[i + 1];

```
 
```
```
            }
```
```
 
```
```
        }
```
```
        n = n - 1;
```
```
        /* 
```

          * Leftward pass will shift the smallest element to its correct place at the beginning

```
          */
```

        for (i= MAX - 1, c = 0; i >= c; i--)

```
        {
```
```
            if(data[i] < data[i - 1])
```
```
            {
```

                data[i] = data[i] + data[i - 1];

                data[i - 1] = data[i] - data[i - 1];

                data[i] = data[i] - data[i - 1];

```
            }
```
```
        }
```
```
        c = c + 1;
```
```
 
```
```
    } while (n != 0 && c != 0);
```
```
    printf("The sorted elements are:");
```
```
    for (i = 0; i < MAX; i++)
```
```
    {
```
```
        printf("%d\t", data[i]);
```
```
    }
```
```
}
```

$ gcc cocktailsort.c
$ a.out
/*
 * Average case
 */
Enter the data
9 6 2 12 11 9 3 7
The sorted elements are:2       3       6       7       9       9       11      12  
/*
 * Worst case
 */
 Enter the data
 8 7 6 5 4 3 2 1
 The sorted elements are:1         2        3        4        5        6        7        8
 /*
  *Best case
  */
  Enter the data
  1 2 3 4 5 6 7 8
  The sorted elements are:1     2        3        4        5        6        7        8

Sanfoundry Global Education & Learning Series – 1000 C Programs.

Here’s the list of Best Books in C Programming, Data-Structures and Algorithms

If you wish to look at programming examples on all topics, go to C Programming Examples.

« Prev - C Program to Implement Bitonic Sort

» Next - C Program to Sort the String and Remove Repeated Characters

Related Posts:

Recommended Articles: