快速排序

Posted 2022-01-19 bigdata-stone

package com.cisco.www.sort;

public class QuickSort 
    public static void quickSort(int[] arr,int L,int R)
        int[] p = partition(arr,L,R);
        quickSort(arr,L,p[0]-1);
        quickSort(arr,p[1]+1,R);
    
    public static int[] partition(int[] arr,int L,int R)
        int less = L -1;
        int more = R+1;
        int cur= L;
        while (cur<more)
            if(arr[cur]<arr[R])
                swap(arr,++less,cur++);
            else if(arr[cur]>arr[R])
                swap(arr,--more,L);
            else 
                cur++;
            
        
        swap(arr,more,R);
        return new int[]less+1,more;
    

    private static void swap(int[] arr, int i, int j) 
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;