java实现梳排序算法

前面我详细讲解了梳排序算法，现在我们用代码来实现下

package ttt;

public class CombSort {
    public static int[] combSort(int[] theArray) {
    	int theLen = theArray.length;
    	int i = (int) (theLen/1.3);
    	while(i >=1){
    		for(int j=0; j<theLen; j++) {
    			if(i+j >= theLen) {
    				i = (int)(i/1.3);
    				break;
    			}else {
    				if(theArray[j] > theArray[i+j]) {
    					int tmp = theArray[j];
    					theArray[j] = theArray[i+j];
    					theArray[i+j] = tmp;
    				}
    			}
    		}
    	}
    	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 = combSort(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 

符合预期