算法复杂度，及三种主要排序算法的研究

public class MainSort {
    private static int[] data = {66,22,55,44,11,33};
    private static int LENGTH = data.length;
    
    public static void main(String args[]){
        System.out.println("hello world");
        sortByChoose();
        System.out.println("result is:");
        printData();
        
    }
    private static void printData() {
        for(int i = 0; i<LENGTH; i++){
            System.out.print("*"+data[i]);
        }
        System.out.print("*");
        System.out.println("");
        
    }
    //选择排序 -- 外层遍历每次找出最小的，放到前面，下次只遍历未排序的后面一段
    private static void sortByChoose(){
        
        for(int unsortSize = LENGTH ; unsortSize>0 ; unsortSize--){
            
            int temp = LENGTH-unsortSize; 
            
            for(int j = LENGTH-unsortSize ; j<LENGTH; j++){ //遍历未排序的找出最小的数的角标
    
                if(data[temp] > data[j]){
                    temp = j;
                }

            }
            System.out.println(""+temp);
            
            int x = data[LENGTH-unsortSize];
            data[LENGTH-unsortSize] = data[temp];
            data[temp] = x;
            
            printData();
        }
    }
    //插入排序
    private static void sortByInsert(){
        
    }
    //冒泡排序
    private static void sortByPop(){
        
    }
}