c-programs/cocktailSort.c at master · khushi-1410/c-programs · GitHub

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

#include <stdio.h>
#include <stdlib.h>
#define Max_Length 8

int main()
{
    int data[Max_Length];
    int i, j, n, c;

    printf("\nEnter the data");
    for (i = 0; i < Max_Length; i++)
    {
        scanf("%d", &data[i]);
    }
    n = Max_Length;
    do
    {
        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;

        for (i = Max_Length - 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_Length; i++)
    {
        printf("%d\t", data[i]);
    }
}