Algorithms/cocktail-sort.java at master · mandy1612/Algorithms · 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
public class CocktailSort
{
	void cocktailSort(int a[])
	{
		boolean swapped = true;
		int start = 0;
		int end = a.length;

		while (swapped == true)
		{
			swapped = false;

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

			if (swapped == false)
				break;

      swapped = false;

			end = end - 1;

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

			start = start + 1;
		}
	}

	void printArray(int a[])
	{
		int n = a.length;
		for (int i = 0; i < n; i++)
			System.out.print(a[i] + " ");
		System.out.println();
	}

	public static void main(String[] args)
	{
		CocktailSort ob = new CocktailSort();
		int a[] = { 5, 1, 4, 2, 8, 0, 2 };
		ob.cocktailSort(a);
		System.out.println("Sorted array");
		ob.printArray(a);
	}
}