快速排序算法

快速排序算法

快速排序算法采用填坑+分治思想

import java.util.Arrays;

public class QuickSort {
    public static void main(String[] args) {
        int[] array={2,4,7,9,1,6,3,7};
        System.out.println(Arrays.toString(array));
        quick_sort(array,0,array.length-1);
        System.out.println(Arrays.toString(array));
    }
    //快速排序算法
    public static void quick_sort(int s[], int left, int right) {
        if(left<right) {
            int i = left, j = right,x=s[left];
            while (i < j) {
                while (i < j && s[j] >= x) j--;
                if (i < j) s[i++] = s[j];
                while (i < j && s[i] < x) i++;
                if (i < j) s[j--] = s[i];
            }
            s[i] = x;
            quick_sort(s, left, i - 1);//迭代左边
            quick_sort(s, i + 1, right);//迭代右边
        }
    }
}

运行结果