java实现快速排序

java实现快速排序

import java.util.Scanner;

public class QuickSortText {
    static int OneQuickSort(int array[],int right,int left)//一趟快排
    {
        int pos = array[right];
        while (right < left)
        {
            while (right < left&&(pos < array[left]))left--;
            array[right] = array[left];
            while (right<left&&(pos>array[right]))right++;
            array[left] = array[right];
        }
        array[right] = pos;
        return right;
    }
    void AllQuickSort(int array[],int right,int left)//递归实现所有快速排序趟数
    {
        if(right < left)
        {
            int mid = OneQuickSort(array,right,left);
            AllQuickSort(array,right,mid-1);
            AllQuickSort(array,mid+1,left);
        }
    }

    public static void main(String[] args) {
        System.out.println("输入数组长度");
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int[] array = new int[n];
        for (int i = 0;i < array.length;i++ )
        {
            array[i] = scan.nextInt();
        }
        QuickSortText quickSortText = new QuickSortText();
        quickSortText.AllQuickSort(array,0,array.length-1);
        for (int i:array)
        {
            System.out.println(i+" ");
        }

    }
}