java排序算法实现

public class SortUtil {
    /*
    快速排序
     */
    public static void fastSort(int[] array,int start,int end){
        if(start >= end){
            return;
        }
        int p = array[start];
        int sold = start;
        int eold = end;
        while (start < end){
            while(start < end && array[end] > p){
                end--;
            }
            if(start >= end){
                break;
            }
            array[start++] = array[end];
            while (start < end && array[start] < p){
                start++;
            }
            if(start >= end){
                break;
            }
            array[end--] = array[start];
        }
        if(start == end){
            array[start] = p;
            fastSort(array,sold,start - 1);
            fastSort(array,start + 1,eold);
        }
    }
    /*
    常规排序
     */
    public static void normalSort(int[] array){
        for(int i = 0;i < array.length;i++){
            for(int j = i + 1;j < array.length;j++){
                if(array[i] > array[j]){
                    int temp = array[i];
                    array[i] = array[j];
                    array[j] = temp;
                }
            }
        }
    }
    /*
    冒泡排序
     */
    public static void bubbleSort(int[] array){
        for(int i = 0;i < array.length - 1;i++){
            for(int j = 0;j < array.length - i - 1;j++){
                if(array[j] > array[j + 1]){
                    int temp = array[j];
                    array[j] = array[j + 1];
                    array[j + 1] = temp;
                }
            }
        }
    }
}