<ul><li>Cocktail sort can be considered as an extension to Bubble Sort Algorithm.</li><li>Here instead of moving in one direction from left to right we move in the opposite direction right to left.</li><li>Cocktail sort will be faster than bubble sort, but it will not change the complexity.</li><li>The complexity will be still O(n^2).</li><li>Our algorithm uses “is_swapped” variable to know if the array is sorted or not.</li><li>The sorted array need not do any swapping.</li><li>Hence taking that as a basis we terminate the main loop.</li><li>Time complexity is O(n^2).</li><li>In the first pass, lowest element is at the left and the highest element is at the right.</li><li>In the second pass, the array is sorted.</li></ul>

Sorting algorithm 8: Cocktail Sort

Discover more