We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e090eda commit 890eca9Copy full SHA for 890eca9
algorithms/sorting/cocktail_sort.py
@@ -0,0 +1,26 @@
1
+def cocktailSort(array)
2
+ n = len(array)
3
+ swap = 1
4
+ begin = 0
5
+ end = n-1
6
+ #Sorting start
7
+ while (swap == 1):
8
+ swap = 0
9
+
10
+ #sorting from begin
11
+ for i in range (begin, end):
12
+ if (a[i] > a[i+1]) :
13
+ a[i], a[i+1]= a[i+1], a[i]
14
+ swap=1
15
16
+ if (swap==0):
17
+ break swap = 0
18
19
+ end = end-1
20
+ #sorting from end
21
+ for i in range(end-1, begin-1,-1):
22
+ if (a[i] > a[i+1]):
23
+ a[i], a[i+1] = a[i+1], a[i]
24
25
26
+ begin = begin+1
0 commit comments