Java面试题 快速排序

快速排序

//快速排序
package QFTest;
public class Test_08 {
    public static void main(String[] args) {
    int[] arrs={5,3,6,2,4,9,7,10,19,194,23,45,35,67,1};
    quickSort(arrs,0, arrs.length-1);
        for (int arr : arrs) {
            System.out.print(arr+"  ");
        }
    }
    public static void quickSort(int[] arrs, int start, int end) {
        int i = start;
        int j = end;
        int prior = arrs[start];
        while (i < j) {
            while (i < j && arrs[j] > prior) {
                j--;
            }
            arrs[i] = arrs[j];
            i++;
            while (i < j && arrs[i] < prior) {
                i++;
            }
            arrs[j] = arrs[i];
            j--;
        }
        arrs[i] = prior;
        //前面有元素
        if (i-1>start) {
            quickSort(arrs, start, i - 1);
        }
        //后面有元素
        if (j+1<end) {
            quickSort(arrs, j + 1, end);
        }
    }
}
//答案
1  2  3  4  5  6  7  9  10  19  23  35  45  67  194