java-algorithms/CocktailSort.java at main · gulafsh/java-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
62
63
64
65
66
67
68
69

publicclassCocktailSort
{
voidcocktailSort(inta[])
	{
booleanswapped = true;
intstart = 0;
intend = a.length;

while (swapped == true)
 {

swapped = false;

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


if (swapped == false)
break;


swapped = false;


end = end - 1;


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


start = start + 1;
 }
	}


voidprintArray(inta[])
	{
intn = a.length;
for (inti = 0; i < n; i++)
System.out.print(a[i] + " ");
System.out.println();
	}

publicstaticvoidmain(String[] args)
	{
CocktailSortob = newCocktailSort();
inta[] = { 5, 1, 4, 2, 8, 0, 2 };
ob.cocktailSort(a);
System.out.println("Sorted array");
ob.printArray(a);
	}
}