图解快数排序法

快速排序图解：

----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

==========================================================================================================================

==========================================================================================================================

java 代码的实现：

package main.test;

public class KSSort {
    public static int Partition(int[] a, int p, int r) {
        int x = a[r - 1];
        int i = p - 1;
        int temp;
        for (int j = p; j <= r - 1; j++) {
            if (a[j - 1] <= x) {
// 交换(a[j-1],a[i-1]);
                i++;
                temp = a[j - 1];
                a[j - 1] = a[i - 1];
                a[i - 1] = temp;
            }
        }
//交换(a[r-1,a[i+1-1]);
        temp = a[r - 1];
        a[r - 1] = a[i + 1 - 1];
        a[i + 1 - 1] = temp;
        return i + 1;
    }


    public static void QuickSort(int[] a,int p,int r){
        if(p<r){
            int q=Partition(a,p,r);
            QuickSort(a,p,q-1);
            QuickSort(a,q+1,r);
        }
    }

    static void print(int[] a) {
        for (int values : a
                ) {
            System.out.print(values+" | ");
        }
    }


    public static void main(String[] args) {
        int[] a={7,10,3,5,4,6,2,8,1,9};
        QuickSort(a,1,10);
        print(a);


    }


}

public class QuickSort {
    public static void quickSort(int[] arr,int low,int high){
        int i,j,temp,t;
        if(low>high){
            return;
        }
        i=low;
        j=high;
        //temp就是基准位
        temp = arr[low];

        while (i<j) {
            //先看右边，依次往左递减
            while (temp<=arr[j]&&i<j) {
                j--;
            }
            //再看左边，依次往右递增
            while (temp>=arr[i]&&i<j) {
                i++;
            }
            //如果满足条件则交换
            if (i<j) {
                t = arr[j];
                arr[j] = arr[i];
                arr[i] = t;
            }

        }
        //最后将基准为与i和j相等位置的数字交换
         arr[low] = arr[i];
         arr[i] = temp;
        //递归调用左半数组
        quickSort(arr, low, j-1);
        //递归调用右半数组
        quickSort(arr, j+1, high);
    }


    public static void main(String[] args){
        int[] arr = {10,7,2,4,7,62,3,4,2,1,8,9,19};
        quickSort(arr, 0, arr.length-1);
        for (int i = 0; i < arr.length; i++) {
            System.out.println(arr[i]);
        }
    }
}