快排

java手撕快排

public static void quickSort(int[] arr,int left,int right){
    int pivot = arr[left];
    int l = left;
    int r = right;
    while (l<r){
        while (l<r &&arr[r]>=pivot){
            r--;
        }
        arr[l] = arr[r];
        while (l<r &&arr[l]<=pivot){
            l++;
        }
        arr[r]=arr[l];
    }
    arr[l]=pivot;
    if(left<right){
        quickSort(arr,left,r-1);
        quickSort(arr,l+1,right);
    }
}

图文解释参考地址：

https://blog.csdn.net/nrsc272420199/article/details/82587933?utm_medium=distribute.pc_relevant.none-task-blog-2%7Edefault%7EBlogCommendFromMachineLearnPai2%7Edefault-2.control&depth_1-utm_source=distribute.pc_relevant.none-task-blog-2%7Edefault%7EBlogCommendFromMachineLearnPai2%7Edefault-2.control