|
package com.test.sort;
public class testmerge {
public static void main(string[] args) {
int [] a = { 1 , 3 , 5 };
int [] b = { 2 , 3 , 4 , 7 };
merge m = new merge();
m.method(a, b);
}
}
class merge {
public void method( int [] a, int [] b) {
int l = a.length + b.length;
int [] temp = new int [l];
int i = 0 , j = 0 , h = 0 ;
while (i < a.length || j < b.length) {
if (i == a.length && j < b.length) {
temp[h++] = b[j++];
} else if (i < a.length && j == b.length) {
temp[h++] = a[i++];
} else if (a[i] <= b[j]) {
temp[h++] = a[i++];
} else if (a[i] > b[j]) {
temp[h++] = b[j++];
}
}
for ( int m : temp) {
system.out.print(m + " " );
|