java版快速排序，插入排序，冒泡排序

package com.cr.excecise;

public class Sort {

    public static void main(String[] args) {
        int num[] = {1,231,4,65,7,8,0,232,151,734,32131};
        //quickSort(num,0,10);
        //bubbleSort(num);
        insertionSort(num,0,10);
        for(int temp:num) System.out.print(temp+" ");
    }
    
    
    //快速排序
    static void quickSort(int []num, int begin, int end){
        if(begin>=end) return;
        int i= begin;
        int j= end;
        int key = num[i];
        
        while(i<j){
            while(i<j&&num[j]>=key)
                j--;
            if(i<j)
                num[i++]=num[j];
            while(i<j&&num[i]<=key)
                i++;
            if(i<j)
                num[j--]=num[i];    
        }
        num[i]=key;
        if(begin<i-1)
            quickSort(num,begin,i-1);
        if(i+1<end)
            quickSort(num,i+1,end);
    }
    //冒泡排序
    static void bubbleSort(int []num){
        int length = num.length;
        for(int i=0;i<length;i++){
            for(int j=0;j<length-i-1;j++){
                int temp = num[j];
                if(num[j+1]<num[j]){
                    num[j] = num[j+1];
                    num[j+1] = temp;
                }
            }
        }
    }
    
    
    //插入排序
    static void insertionSort(int []num,int begin,int end){
        int temp,j;
        for(int i=begin+1;i<=end;i++){
            temp = num[i];
            j=i-1;
            
            while(j>begin&&num[j-1]>temp){
                num[j] = num[j-1]; 
                j--;
            }
            num[j] = temp;
        }
    }

}

记住这三种常用的排序方法！