data-structure/coctailSort.cpp at main · ChauhanDiya/data-structure · 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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
// C++ implementation of Cocktail Sort
#include <bits/stdc++.h>
using namespace std;
#include<time.h>


void CocktailSort(int a[], int n)
{
	bool swapped = true;
	int start = 0;
	int end = n - 1;

	while (swapped) {

		swapped = false;


		for (int i = start; i < end; ++i) {
			if (a[i] > a[i + 1]) {
				swap(a[i], a[i + 1]);
				swapped = true;
			}
		}


		if (!swapped)
			break;


		swapped = false;


		--end;


		for (int i = end - 1; i >= start; --i) {
			if (a[i] > a[i + 1]) {
				swap(a[i], a[i + 1]);
				swapped = true;
			}
		}


		++start;
	}
}


void printArray(int a[], int n)
{
	for (int i = 0; i < n; i++)
		printf("%d ", a[i]);
	printf("\n");
}


int main()
{
	int a[] = { 5, 1, 4, 2, 8, 0, 2 };
	int n = sizeof(a) / sizeof(a[0]);
    clock_t st,ft;
    double tt;
    st=clock();
	CocktailSort(a, n);
    ft=clock();
    tt=((double)ft-st);
	printf("Sorted array :\n");
    cout<<"Execution time:"<<tt;
	printArray(a, n);
	return 0;
}