鸡尾酒排序Java程序

鸡尾酒排序是冒泡排序的一种变体。 Bubble排序算法始终从左遍历元素，并在第一次迭代中将最大的元素移到其正确的位置，在第二次迭代中将其移到第二个最大的位置，依此类推。鸡尾酒排序在两个方向上交替遍历给定数组。

算法：
算法的每次迭代都分为两个阶段：

1. 第一级从左到右循环遍历数组，就像冒泡排序一样。在循环期间，将比较相邻的项目，如果左侧的值大于右侧的值，则将交换值。在第一次迭代结束时，最大数量将驻留在数组的末尾。
2. 第二阶段以相反的方向循环通过数组-从刚排序的项目之前的项目开始，然后移回数组的开头。同样，在这里，比较相邻的项目，并在需要时进行交换。

// Java program for implementation of Cocktail Sort
public class CocktailSort {
    void cocktailSort(int a[])
    {
        boolean swapped = true;
        int start = 0;
        int end = a.length;
  
        while (swapped == true) {
            // reset the swapped flag on entering the
            // loop, because it might be true from a
            // previous iteration.
            swapped = false;
  
            // loop from bottom to top same as
            // the bubble sort
            for (int i = start; i < end - 1; ++i) {
                if (a[i] > a[i + 1]) {
                    int temp = a[i];
                    a[i] = a[i + 1];
                    a[i + 1] = temp;
                    swapped = true;
                }
            }
  
            // if nothing moved, then array is sorted.
            if (swapped == false)
                break;
  
            // otherwise, reset the swapped flag so that it
            // can be used in the next stage
            swapped = false;
  
            // move the end point back by one, because
            // item at the end is in its rightful spot
            end = end - 1;
  
            // from top to bottom, doing the
            // same comparison as in the previous stage
            for (int i = end - 1; i >= start; i--) {
                if (a[i] > a[i + 1]) {
                    int temp = a[i];
                    a[i] = a[i + 1];
                    a[i + 1] = temp;
                    swapped = true;
                }
            }
  
            // increase the starting point, because
            // the last stage would have moved the next
            // smallest number to its rightful spot.
            start = start + 1;
        }
    }
  
    /* Prints the array */
    void printArray(int a[])
    {
        int n = a.length;
        for (int i = 0; i < n; i++)
            System.out.print(a[i] + " ");
        System.out.println();
    }
  
    // Driver method
    public static void main(String[] args)
    {
        CocktailSort ob = new CocktailSort();
        int a[] = { 5, 1, 4, 2, 8, 0, 2 };
        ob.cocktailSort(a);
        System.out.println("Sorted array");
        ob.printArray(a);
    }
}

输出：

Sorted array
0 1 2 2 4 5 8

请参阅关于鸡尾酒排序的完整文章，以了解更多详细信息！