java快速排序

思路：
先确定一个值，然后将从左开始遍历，寻找一个大于这个数的，然后从右边遍历寻找一个比他小的，进行交换，然后将选到的这个值放到从左和从右遍历交叉的地方，然后把左边这一段和右边这一段再重复这个步骤，直到每一段最小，则完成排序。

代码：

package com.wangyq.datastructrue.sort;

import java.util.Arrays;

public class Speediness {
    public static void main(String[] args) {
        //定义排序前数组，随机数100个
        int[] ints = new int[100];
        for (int i = 0; i < 100; i++) {
            ints[i] = (int) (Math.random() * 100);
        }
        System.out.println("排序前：" + Arrays.toString(ints));
        speediness(ints, 0, ints.length - 1);
        System.out.println("排序后：" + Arrays.toString(ints));
    }

    /**
     * 快速排序
     *
     * @param ints  待排列的数组
     * @param left  起始角标
     * @param right 结束角标
     */
    private static void speediness(int[] ints, int left, int right) {
        //如果起始角标不小于结束角标退出递归
        if (right <= left) {
            return;
        }
        //记录开始结束角标，最后赋值使用
        int l = left;
        int r = right;
        //用最末尾值当中间值
        int temp = ints[r];
        //左右循环找到左边大于循环值，右边小于循环值，注意内部两个while循环先后顺序，与最后赋值有关
        while (l != r) {
            while (ints[l] <= temp && r > l) {
                l++;
            }
            while (ints[r] >= temp && r > l) {
                r--;
            }
            if (l < r) {
                int t = ints[r];
                ints[r] = ints[l];
                ints[l] = t;
            }
        }
        //将最后一个值与大于他的最靠前的进行交换
        ints[right] = ints[r];
        ints[r] = temp;
        //中间值没有必要参与递归
        speediness(ints, r + 1, right);
        speediness(ints, left, r - 1);

    }
}

运行结果：
排序前：[25, 81, 99, 18, 9, 84, 20, 90, 98, 85, 71, 42, 80, 89, 69, 40, 97, 40, 92, 29, 29, 74, 78, 5, 19, 18, 48, 85, 89, 24, 33, 11, 84, 50, 35, 35, 94, 37, 88, 24, 91, 79, 68, 11, 20, 12, 16, 58, 45, 91, 54, 77, 56, 90, 77, 69, 4, 92, 40, 76, 91, 98, 37, 42, 26, 41, 80, 92, 8, 46, 74, 95, 34, 56, 89, 68, 6, 85, 70, 32, 38, 50, 66, 49, 96, 6, 77, 26, 53, 61, 12, 95, 55, 63, 99, 14, 22, 94, 84, 18]
排序后：[4, 5, 6, 6, 8, 9, 11, 11, 12, 12, 14, 16, 18, 18, 18, 19, 20, 20, 22, 24, 24, 25, 26, 26, 29, 29, 32, 33, 34, 35, 35, 37, 37, 38, 40, 40, 40, 41, 42, 42, 45, 46, 48, 49, 50, 50, 53, 54, 55, 56, 56, 58, 61, 63, 66, 68, 68, 69, 69, 70, 71, 74, 74, 76, 77, 77, 77, 78, 79, 80, 80, 81, 84, 84, 84, 85, 85, 85, 88, 89, 89, 89, 90, 90, 91, 91, 91, 92, 92, 92, 94, 94, 95, 95, 96, 97, 98, 98, 99, 99]