java实现鸡尾酒排序算法

前面我们讲解了鸡尾酒排序，今天我们来用代码实现下

package ttt;

public class CocktailSort {
    public static int[] cocktailSort(int[] theArray) {
        while(true){
        	boolean flag = false;
        	for(int i=0; i<theArray.length-1; i++) {
            	if(theArray[i] > theArray[i+1]) {
            		int tmp = theArray[i];
            		theArray[i] = theArray[i+1];
            		theArray[i+1] = tmp;
            		flag = true;
            	}
            }
            for(int j=theArray.length-1; j>0; j--) {
            	if(theArray[j-1] > theArray[j]) {
            		int tmp = theArray[j];
            		theArray[j] = theArray[j-1];
            		theArray[j-1] = tmp;
            		flag = true;
            	}
            }
            if(!flag) {
            	break;
            }
        }
    	return theArray;
    }
    public static void main(String[] args) {
    	int []theArray = {10,1,18,30,23,12,7,5,18,17};
        System.out.print("之前的排序：");
        for(int i = 0; i < theArray.length; i++) {
            System.out.print(theArray[i] + " ");
        }
        
        int []resultArray = cocktailSort(theArray);
        
        System.out.print("鸡尾酒排序：");
        for(int i = 0; i < resultArray.length; i++) {
            System.out.print(resultArray[i] + " ");
        }
    }
}

运行一下

之前的排序：10 1 18 30 23 12 7 5 18 17 鸡尾酒排序：1 5 7 10 12 17 18 18 23 30 

符合预期