【算法】排序算法

复习基础排序算法（Java）

import java.util.Random;
class Solution {
    private static final Random RANDOM = new Random();
    public int[] sortArray(int[] nums) {
        quickSort(nums,0,nums.length-1);
        return nums;
    }
    public void quickSort(int[] nums,int start,int end){
        if(start >= end){
            return;
        }
        int k = partition(nums,start,end);
        quickSort(nums,start,k-1);
        quickSort(nums,k+1,end);
    }

    public int partition(int[] nums,int start,int end){
     int randomIndex = RANDOM.nextInt(end - start + 1) + start;
        swap(nums, start, randomIndex);


        int priot = nums[start];
        int index = start;// [start,index-1]=priot
        for(int i= start+1;i<=end;i++){
            if(nums[i] 
插入排序 
归并排序