快速排序Java

import java.util.Arrays;

public class Main {

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

    public static void sort(int num[], int start, int end){
        int i = start;
        int j = end;
        int key = num[start];

        while (i<j){
            while ((i<j) && (num[j]>=key)){
                j--;
            }

            if(i<j){
                swap(num, i , j);
            }

            while ((i<j) && (num[i]<=key)){
                i++;
            }

            if(i<j){
                swap(num, i , j);
            }
        }


        if(j-1>=start){
            sort(num, start, j-1);
        }

        if(i+1<=end){
            sort(num, i+1, end);
        }
    }



    public static void main(String[] args) {

        int[] nums = { 3, 1, 5, 6 , 20, 4 };
        sort(nums, 0, nums.length-1);

        System.out.println(Arrays.toString(nums));
        
    }
}