双向冒泡排序

package sort;public class CocktailSort1 {    public static void Swap(int array[],int i,int j){        int temp = array[i];        array[i] = array[j];        array[j] = temp;    }    public static void CocktailSort(int array[]){        int left = 0,right = array.length - 1,j;        while(left < right){            for(j = left;j < right;j++ ){                if(array[j] > array[j+1]){                    Swap(array,j,j+1);                }            }            right--;            for(j = right;j > left;j--){                if(array[j] < array[j-1]){                    Swap(array,j,j-1);                }            }            left++;        }    }    public static void main(String[] args) {        int array[] = {19, 17, 16, 12, 9, 15, 1, 2, 11, 7, 3, 10, 14};         CocktailSort(array);          for(int k = 0;k < array.length;k++)             System.out.print(array[k]+" ");    }}