merge sorted array b in sorted array a, assume a has enough space to hold b in the end.

gistfile1.java

int[] merge(int[] a, int[] b){

int aEnd=a.length-1;
int bEnd=b.length-1;
int mergedEnd=aEnd+bEnd+1;

while(aEnd>=0&&bEnd>=0){
if(a[aEnd]=b[bEnd]){
a[mergeEnd]=a[aEnd];
aEnd--;
bEnd--;
mergedEnd--;

}
else if(a[End]>b[End]){
  a[mergedEnd]=a[aEnd];
  aEnd--;
  mergedEnd--;
  
}
else{
  
  a[mergedEnd]=b[bEnd];
  bEnd--;
  mergedEnd--
  
}

}
while(bEnd>=0){
  a[mergedEnd--]=b[bEnd--];
  
}
return a;
}