Java排序算法

1.插入排序

public static void insertSort(){
    int a[] = {45,5,2,58,1,51,23,526,185,52};
    int temp = 0;
    for(int i = 1;i < a.length;i++){
        int j = i - 1;
        temp = a[i];
        for(;j >= 0 && temp < a[j];j--){
            a[j + 1] = a[j];
        }
        a[j + 1] = temp;
    }
    for(int i = 0;i < a.length;i++){
        System.out.print(a[i] + " ");
    }
}

2.希尔排序

public static void shellSort(){
    int a[] = {45,5,2,58,1,51,23,526,185,52};
    double d1 = a.length;
    int temp = 0;
    while(true){
        d1 = Math.ceil(d1 / 2);
        int d = (int)d1;
        for(int x = 0; x < d; x++){
            for(int i = x + d; x < a.length; x += d){
                int j = i - d;
                temp = a[i];
                for(;j >= 0 && temp < a[j]; j -= d){
                    a[j + d] = a[j];
                }
                a[j + d] = temp;
            }
        }
        if(d == 1){
            break;
        }
    }
    for(int i = 0; i < a.length; i++){
        System.out.print(a[i] + " ");
    }
}

3.选择排序

public static void selectSort(){
    int a[] = {45,5,2,58,1,51,23,526,185,52};
    int position = 0;
    int temp = 0;
    for(int i = 0; i < a.length; i++){
        position = i;
        temp = a[i]
        for(int j = i + 1;j < a.length;j++){
            if(a[j] < temp){
                temp = a[j];
                position = j;
            }
        }
        a[position] = a[i];
        a[i] = temp;
    }
    for(int i = 0; i < a.length; i++){
        System.out.print(a[i] + " "};
    }
}

4.冒泡排序

public static void bubbleSort(){
    int a[] = {45,5,2,58,1,51,23,526,185,52};
    int temp = 0;
    for(int i = 0; i < a.length - 1; i++){
        for(int j = 0; j < a.length - 1 - i; i++){
            if(a[j] > a[j + 1]){
                temp = a[j];
                a[j] = a[j + 1];
                a[j + 1] = temp;
            }
        }
    }
    for(int i = 0; i < a.length; i++){
        System.out.print(a[i] + " ");
    }
}

5.快速排序

public static void quickSort(){
    int a[] = {45,5,2,58,1,51,23,526,185,52};

}

public static void _quickSort(int[] a; int low; int high){
    if(low < high){
        int middle = getMiddle(a,low,high);
        _quickSort(a,low,middle - 1);
        _quickSort(a,middle + 1,high);
    }
}

public static int getMiddle(int[] a;int low;int high){
    int temp = a[low];
    while(low < high){
        while(low < high && a[high] >= temp){
            high--;
        }
        a[low] = a[high];
        while(low < high && a[low] <= temp){
            low++;
        }
        a[high] = a[low];
    }
    a[low] = temp;
    return low;
}