java归并排序（整数数组和list列表）

import java.util.*;

public class Mergesort {
 
 public static void merge(List<MrBean> list,int low,int mid,int high)
 {
  List<MrBean> temp=new ArrayList<MrBean>();
  int s=low;
  int t=mid+1;
  int k=0;
  while(s<=mid&&t<=high)
  {
   if(list.get(s).getTRX_ID()<=list.get(t).getTRX_ID())
   {
    temp.set(k, list.get(s));
    k++;
    s++;
   }
   else
   {
    temp.set(k, list.get(t));
    k++;
    t++;
   }
  }
  while(s<=mid)
  {
   temp.set(k, list.get(s));
   k++;
   s++;
  }
  while(t<=high)
  {
   temp.set(k, list.get(t));
   k++;
   t++;
  }
  for(int i=0;i<temp.size();i++)
  {
   list.set(low+i,temp.get(i));
  }
 }
 
 /**
  * 归并排序（列表）
  * **/
 public static void mergesort(List<MrBean> list,int low,int high)
 {
  if(low<high)
  {
   mergesort(list,low,(low+high)/2);
   mergesort(list,(low+high)/2,high);
   merge(list,low,(low+high)/2,high);
  }
 }
 
 
    public static void merge(int[]a,int low,int mid,int high){  
        int[]b=new int[high-low+1];  
        int s=low;  
        int t=mid+1;  
        int k=0;  
        while(s<=mid&&t<=high){  
            if(a[s]<=a[t])  
                b[k++]=a[s++];  
            else 
                b[k++]=a[t++];  
        }  
        while(s<=mid)  
            b[k++]=a[s++];  
        while(t<=high)  
            b[k++]=a[t++];  
        for(int i=0;i<b.length;i++){  
            a[low+i]=b[i];  
        }  
    }  
   
    /**
     * 归并排序（整数数组）
     * **/
    public static void mergesort(int a[],int low,int high){  
        if(low<high){  
            mergesort(a,low,(low+high)/2);  
            mergesort(a,(low+high)/2+1,high);  
            merge(a,low,(high+low)/2,high);  
        }  
    }  
    public static void main(String[]args){  
        int[]a={1,15,24,26,58,45,14,15,14,74};  
        mergesort(a,0,a.length-1);  
        for(int i=0;i<a.length;i++){  
            System.out.print(a[i]+" ");  
        }  
    }  
}