排序算法

    public static void sort(int[] a,int left,int right) {     //快速排序
         if(left < right){
             int key = a[left];
             int low = left;
             int high = right;
             while(low < high){
                     while(low < high && a[high] > key){
                             high--;
                     }
                     
                     while(low < high && a[low] < key){
                             low++;
                     }
                     
                     a[low] = a[low]^a[high];
                     a[high] = a[high]^a[low];
                     a[low] = a[low]^a[high];                    
             }
             a[low] = key;
             sort(a,left,low-1);
             sort(a,low+1,right);
             }
    }

    public static void sort(int[] a) {   //冒泡排序
         for(int i=0;i<a.length;i++) {
             for(int j=0;j<a.length-1;j++) {
                 if(a[j]>a[j+1]) {
                     a[j] = a[j]^a[j+1];
                     a[j+1] = a[j+1]^a[j];
                     a[j] = a[j]^a[j+1];
                 }
             }
         }
    }

    public static void sort(int[] a) {    //选择排序
    
        for(int i=0;i<a.length;i++) {
            int flag = i;
            for(int j=i;j<a.length-1;j++) {                
                if(a[j+1]<a[flag]) {
                    flag = j+1;
                }
            }
            if(flag!=i) {
            a[i] = a[i]^a[flag];
            a[flag] = a[flag]^a[i];
            a[i] = a[i]^a[flag];
            }
        }
    }

    public static void sort(int[] a) {  //插入排序
        int flag,j;
        for(int i=1;i<a.length;i++) {
            flag = a[i];
            for(j=i-1;j>=0 && flag<a[j];j--) {
                a[j+1] = a[j];
            }
            a[j+1] = flag;
        }
    }

    public static int[] sort(int[] a, int low, int high) {    //归并排序
        int mid = (low + high) / 2;  
        if (low < high) {  
            // 左 
            sort(a, low, mid);  
            // 右
            sort(a, mid + 1, high);  
            // 合并
            merge(a, low, mid, high);  
        }  
        return a;  
    } 
     public static void merge(int[] a, int low, int mid, int high) {  
            int[] flag = new int[high - low + 1];  
            int i = low;
            int j = mid + 1;
            int k = 0;  
      
            
            while (i <= mid && j <= high) {  
                if (a[i] < a[j]) {  
                    flag[k++] = a[i++];  
                } else {  
                    flag[k++] = a[j++];  
                }  
            }  
      
           //剩余
            while (i <= mid) {  
                flag[k++] = a[i++];  
            }  
      
            //剩余
            while (j <= high) {  
                flag[k++] = a[j++];  
            }  
      
            
            for (int k2 = 0; k2 < flag.length; k2++) {  
                a[k2 + low] = flag[k2];  
            }  
        }