Merge pull request #40 from anumehaagrawal/master

Cocktail sort

algo.py

@@ -0,0 +1,33 @@
+# Cocktail sorting
+
+
+
+
+def cocktailsort(a):
+	n=len(a)
+	swapped=True
+	start=0
+	end=n-1
+	while(swapped==True):
+		swapped=False
+
+		for i in range(start,end):
+			if (a[i] > a[i+1]) :
+				a[i], a[i+1]= a[i+1], a[i]
+				swapped=True
+		if (swapped==False) :
+			break
+		swapped=False
+		end=end-1
+		for i in range(end-1,start-1,-1) :
+			if (a[i] > a[i+1]) :
+				a[i], a[i+1]= a[i+1], a[i]
+				swapped=True
+		start=start+1
+
+a=[8,2,1,3,4]
+cocktailsort(a)
+print("Sorted array is:")
+for i in range(len(a)):
+	print ("%d" %a[i]),
+