伪代码

将一个序列由小到大进行排序：

function cocktail_sort(list, list_length){ // the first element of list has index 0 bottom = 0; top = list_length - 1; swapped = true; while(swapped == true) // if no elements have been swapped, then the list is sorted { swapped = false; for(i = bottom; i < top; i = i + 1) { if(list[i] > list[i + 1]) // test whether the two elements are in the correct order { swap(list[i], list[i + 1]); // let the two elements change places swapped = true; } } // decreases top the because the element with the largest value in the unsorted // part of the list is now on the position top top = top - 1; for(i = top; i > bottom; i = i - 1) { if(list[i] < list[i - 1]) { swap(list[i], list[i - 1]); swapped = true; } } // increases bottom because the element with the smallest value in the unsorted // part of the list is now on the position bottom bottom = bottom + 1; }}

与冒泡排序不同的地方

鸡尾酒排序等于是冒泡排序的轻微变形。不同的地方在于从低到高然后从高到低，而冒泡排序则仅从低到高去比较序列里的每个元素。他可以得到比冒泡排序稍微好一点的性能，原因是冒泡排序只从一个方向进行比对（由低到高），每次循环只移动一个项目。

以序列(2,3,4,5,1)为例，鸡尾酒排序只需要访问一次序列就可以完成排序，但如果使用冒泡排序则需要四次。但是在随机数序列的状态下，鸡尾酒排序与冒泡排序的效率都很差劲。

实现示例

C语言

void cocktail_sort(int arr[], int len) { int i, left = 0, right = len - 1; int temp; while (left < right) { for (i = left; i < right; i++) if (arr[i] > arr[i + 1]) { temp = arr[i]; arr[i] = arr[i + 1]; arr[i + 1] = temp; } right--; for (i = right; i > left; i--) if (arr[i - 1] > arr[i]) { temp = arr[i]; arr[i] = arr[i - 1]; arr[i - 1] = temp; } left++; }}

C++

template //整數或浮點數皆可使用,若要使用物件(class)時必須設定大於(>)的運算子功能void cocktail_sort(T arr[], int len) { int j, left = 0, right = len - 1; while (left < right) { for (j = left; j < right; j++) if (arr[j] > arr[j + 1]) swap(arr[j], arr[j + 1]); right--; for (j = right; j > left; j--) if (arr[j - 1] > arr[j]) swap(arr[j - 1], arr[j]); left++; }}

JAVA

public static void cocktail_sort(int[] arr) { int i, left = 0, right = arr.length - 1; int temp; while (left < right) { for (i = left; i < right; i++) if (arr[i] > arr[i + 1]) { temp = arr[i]; arr[i] = arr[i + 1]; arr[i + 1] = temp; } right--; for (i = right; i > left; i--) if (arr[i - 1] > arr[i]) { temp = arr[i]; arr[i] = arr[i - 1]; arr[i - 1] = temp; } left++; }}

JavaScript

Array.prototype.cocktail_sort = function() { var i, left = 0, right = this.length - 1; var temp; while (left < right) { for (i = left; i < right; i++) if (this[i] > this[i + 1]) { temp = this[i]; this[i] = this[i + 1]; this[i + 1] = temp; } right--; for (i = right; i > left; i--) if (this[i - 1] > this[i]) { temp = this[i]; this[i] = this[i - 1]; this[i - 1] = temp; } left++; }};

PHP

function swap(&$x, &$y) { $t = $x; $x = $y; $y = $t;}function cocktail_sort(&$arr) {//php的陣列視為基本型別，所以必須用傳參才能修改原陣列 $left = 0; $right = count($arr) - 1; while ($left < $right) { for ($j = $left; $j < $right; $j++) if ($arr[$j] > $arr[$j + 1]) swap($arr[$j], $arr[$j + 1]); $right--; for ($j = $right; $j > $left; $j--) if ($arr[$j - 1] > $arr[$j]) swap($arr[$j - 1], $arr[$j]); $left++; }}

Python 2.7

def cocktail_sort(l): l_len = len(l) for i in xrange(l_len, 0, -1): rem_i_l_len = abs(i - l_len) isNeedContinue = False obverse_count = len(l[rem_i_l_len : i-1]) reverse_count = len(l[rem_i_l_len + 1 : i-1]) for j in xrange(obverse_count): if l[j] > l[j + 1]: l[j], l[j + 1] = l[j + 1], l[j] isNeedContinue = True # you can print this to observe the whole process # print l for j in xrange(reverse_count, 0, -1): if l[j] < l[j - 1]: l[j], l[j - 1] = l[j - 1], l[j] isNeedContinue = True # you can print this to observe the whole process # print l if isNeedContinue: continue else: return if __name__ == '__main__': sample_list = [6,5,4,3,2,100] cocktail_sort(sample_list) print sample_list