快排-递归

1. 废话不说，直接上代码

public class quickSoort {
    /**
     * 快排 递归
     *
     * @param args
     */

    private static int count;

    public static void main(String[] args) {
        int[] num = {3, 45, 78, 64, 52, 11, 64, 55, 99, 11, 18};
        System.out.println(arrayToString(num, "未排序"));
        QuickSort(num, 0, num.length - 1);
        System.out.println(arrayToString(num, "排序"));
        System.out.println("数组个数：" + num.length);
        System.out.println("循环次数：" + count);
    }

    /**
     * @param num
     * @param left
     * @param right
     */

    private static void QuickSort(int[] num, int left, int right) {
        if (left >= right) {
            return;
        }
        int key = num[left];
        int i = left;
        int j = right;
        while (i < j) {
            //从右往左，找比key小的
            while (num[j] >= key && i < j) {
                j--;
            }
            while (num[i] <= key && i < j) {
                i++;
            }
            if (i < j) {
                int temp = num[i];
                num[i] = num[j];
                num[j] = temp;
            }


        }

        //问题 疑惑 所在
        num[left] = num[i];
        num[i] = key;
        count++;
        QuickSort(num, left, i - 1);
        QuickSort(num, i + 1, right);


    }

    /**
     * 将一个int类型数组转化为字符串
     *
     * @param arr
     * @param flag
     * @return
     */
    private static String arrayToString(int[] arr, String flag) {
        String str = "数组为(" + flag + ")：";
        for (int a : arr) {
            str += a + "\t";
        }
        return str;
    }
}

所遇问题：

num[left] = num[i];
num[i] = key;

这段代码是将基数归位。