数据结构与算法-快速排序法

package com.yonyou;


public class demo4 {
    public static void main(String[] args) {
        int[] arr = new int[]{0,3,2,7,4,6,3,9,5,3,1,0,5};
        sortQuickly(arr, 0, arr.length - 1);
        for(int i =0; i < arr.length; i++){
            System.out.print(arr[i]);
        }



    }

    private static void sortQuickly(int[] arr, int begin, int end) {

        if (begin >= end) {
            return;
        }

        int b = begin;
        int e = end;
        int p = arr[begin];

        while (b < e) {

            while (arr[e] >= p && b < e) {
                e--;
            }

            while (arr[b] <= p && b < e) {
                b++;
            }


            if (b < e) {
                int temp = arr[e];
                arr[e] = arr[b];
                arr[b] = temp;
            }
        }

        arr[begin] = arr[b];
        arr[b] = p;

        sortQuickly(arr, begin, b - 1);
        sortQuickly(arr, b + 1, end);


    }


}