排序

public class Sort {
    public static void main(String[] args) {

        int[] arr={6,1,2,7,9,3,4,5,10,8,32,23,4,42,43,43,432,423,2434,234,333,34,24,23,23,23,3,4,5,6,8,4,3,3,3,3,3,90,3,45,54,6,88,8};
        long l1 = System.currentTimeMillis();
        InsertSort(arr);
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]+" ");
        }
        long l2 = System.currentTimeMillis();
        System.out.println();
        System.out.println(l2-l1);
    }
    public static void ChooseSort(int arr[]){
        for (int i = 0; i < arr.length-1; i++) {
            int min=arr[i];
            for (int j = i+1; j < arr.length; j++) {
                if(arr[j]<min)
                {
                    int temp=arr[i];
                    arr[i]=arr[j];
                    arr[j]=temp;
                    min=arr[i];
                }
            }
        }
    }
    public static void InsertSort(int arr[]){
        for (int i = 1; i < arr.length; i++) {
            int key=arr[i];
            int j=i-1;
            while(j>=0 && arr[j]>key){
                arr[j+1]=arr[j];
                j--;
            }
            arr[j+1]=key;
        }
    }
    public static void BubbleSort(int arr[]){
        for(int i=0;i<arr.length;i++){
            for(int j=0;j<arr.length-i-1;j++){
                if(arr[j]>arr[j+1]){
                    int temp=arr[j];
                    arr[j]=arr[j+1];
                    arr[j+1]=temp;
                }
            }
        }
    }
}