归并排序
上一篇 /
下一篇 2012-06-13 21:27:16
/ 个人分类:java
public class test1 {
static int numArr[];
//二分法查找
static void merge(int a[], int b[] )
{
int alength = a.length;
int blength= b.length;
int c[]= new int[blength+alength];
int no;
int a1=0,b1=0;
if(alength> blength)
{
no=blength;
}
else
{no=alength;}
for(int i=0; i<c.length;i++)
{
if((a1<alength) && (b1<blength))
{
if(a[a1]>=b[b1])
{c[i]=b[b1]; b1++;}
else
{c[i]=a[a1]; a1++;}
}
else{
if(a1<alength){
c[i]=a[a1]; a1++;
}
if(b1<blength){
c[i]=b[b1]; b1++;
}
}
}
for(int i=0; i<c.length;i++)
{
System.out.println(c[i]);
}
}
public static void main(String[] args) {
// TODO Auto-generated method stub
numArr= new int[9];
int[] a={2,5,9};
int[] b={1,2,15,29};
merge( a, b);
}
}
收藏
举报
TAG: