code

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
53
54
55
56
57
58
59
#include <stdio.h>

void swap(int *arr, int a, int b)
{
  int tmp = arr[a];
  arr[a] = arr[b];
  arr[b] = tmp;
}

void cocktailsort(int* arr, int n)
{
  int tmp = 0, i = 1, l = 0, r = n-1, last = n-1;

  while(l != r)
  {
    if(i % 2 == 0)
    {
      for(int j = r; j > l; j--)
      {
        if(arr[j-1] > arr[j])
        {
          swap(arr, j-1, j);
          last = j;
        }
      }
      l = last;
    }
    else if(i % 2 == 1)
    {
      for(int j = l; j < r; j++)
      {
        if(arr[j] > arr[j+1])
        {
          swap(arr, j, j+1);
          last = j;
        }
      }
      r = last;
    }
    i++;
  }
}

int main(void)
{
  int arr[] = {5,2,1,3,7,9,4,8,12,15,14,11,13,10,6};
  int size = sizeof(arr) / sizeof(int);
  for(int i = 0; i < size; i++)
    printf("%d ", arr[i]);
  printf("\n");
  
  cocktailsort(arr, size);

  for(int i = 0; i < size; i++)
    printf("%d ", arr[i]);
  printf("\n");

  return 0;
}