快速排序原理探究

代码

package com.org;

/**
 * @author zhang kun
 * @Classname QuickSort
 * @Description TODO
 * @Date 2021/5/18 15:34
 */
public class QuickSort {
    public static void main(String[] args) {
            int[] nums = {1,3,4,52,22,67,32,0};
            sort(nums,0,nums.length-1);
            for(int i : nums){
                System.out.print(i + " ");;
            }
    }
    public static void sort(int[] num,int left,int right){
        if(left >= right){
            return;
        }
        int p = partiton(num,left,right);
        sort(num,left,p-1);
        sort(num,p+1,right);
    }

    private static int partiton(int[] num,int left,int right) {
        int i = left;
        int j = right + 1;
        if(left == right){
            return left;
        }
        int pivort = num[left];
        while(true){
            while(num[--j] > pivort){
                if(j == left){
                    break;
                }
            }
            while(num[++i] < pivort){
                if(i == right){
                    break;
                }
            }
            if(i>=j){
                break;
            }
            swap(num,i,j);
        }
        swap(num,left,j);
        return j;
    }

    private static void swap(int[] num, int i, int j) {
        int temp = num[i];
        num[i] = num[j];
        num[j] = temp;
    }
}

漫画