JAVA数据结构 归并排序

归并排序

 /* * Kiss_My_Love * 2012/8/31 * 归并排序 **/ public static Object[] mergeSort(Object[] arr,Object[] arr2){ Object[] obj = null; int n=arr.length+arr2.length; obj=new Object
; int i,j,k=0; for(i=0,j=0;i<arr.length&&j<arr2.length;){ if((Integer)arr[i]>(Integer)arr2[j]){ obj[k++]=arr2[j++]; }else { obj[k++]=arr[i++]; } } while(i<arr.length){ obj[k++]=arr[i++]; } while(j<arr2.length){ obj[k++]=arr[j++]; } // for(int n1 =0;n1<obj.length;n1++){ // System.out.println(obj[n1]); // } return obj; }