2016 Update

Task/Sorting-algorithms-Cocktail-sort/Python/sorting-algorithms-cocktail-sort-3.py

@@ -0,0 +1,16 @@
+def cocktail(a):
+    for i in range(len(a)//2):
+        swap = False
+        for j in range(1+i, len(a)-i):
+            if a[j] < a[j-1]:
+                a[j], a[j-1] = a[j-1], a[j]
+                swap = True
+        if not swap:
+            break
+        swap = False
+        for j in range(len(a)-i-1, i, -1):
+            if a[j] < a[j-1]:
+                a[j], a[j-1] = a[j-1], a[j]
+                swap = True
+        if not swap:
+            break