75. Sort Colors

Given an array with n objects colored red, white or blue, sort them
so that objects of the same color are adjacent, with the colors in the
order red, white and blue.

Here, we will use the integers 0, 1, and 2 to represent the color red,
white, and blue respectively.

Note: You are not suppose to use the library’s sort function for this
problem.

在此采用了对小规模数组使用插排的归并排序，效果不好，我认为三项切分快排效果会更好，因为针对重复元素。

想说的是在用含插排的归并时候，要注意插排的细节和单独插排并不相同：

class Solution {
    private int[] aux;
    public void sortColors(int[] nums){
        aux = new int[nums.length];
        int lo = 0;
        int hi = nums.length;
        mergeSort(nums, lo, hi-1);
    }
    public void mergeSort(int[] nums, int lo, int hi){
        if(hi <= lo + 5){ 
            insertSort(nums, lo, hi);
            return;
        }
        int mid = (hi-lo)/2 + lo;
        mergeSort(nums, lo, mid);
        mergeSort(nums, mid+1, hi);
        merge(nums, lo, mid, hi);
    }
    public void merge(int[] nums, int lo, int mid, int hi){
        for(int k = lo; k <= hi; k++){
            aux[k] = nums[k];
        }
        int i = lo;
        int j = mid+1;
        for(int k = lo; k <= hi; k++){
            if(i > mid)                     nums[k] = aux[j++];
            else if(j > hi)                 nums[k] = aux[i++];
            else if(aux[i] < aux[j])        nums[k] = aux[i++];
            else                            nums[k] = aux[j++];
        }
    }
    //加入了上下限制，并且for循环的起点也有改变
    public void insertSort(int[] nums, int lo, int hi) {
        for(int i = lo; i <= hi; i++){
            for(int j = i; j > lo && nums[j] < nums[j-1]; j--){
                    exchange(nums, j, j-1);
            }
        }
    }
/*传统插排
    public void insertSort(int[] nums) {
        for(int i = 1; i < nums.length; i++){
            for(int j = i; j > 0 && nums[j] < nums[j-1]; j--){
                    exchange(nums, j, j-1);
            }
        }
    }
*/
    public void exchange(int[] nums, int a, int b){
        int temp = nums[a];
        nums[a] = nums[b];
        nums[b] = temp;
    }
}