Array Merge Algo

by Pritesh Patel

JavaScript

let A = [2,8,15,18];
let B = [5,9,12,17];
let C = [];
let i=0; j=0; k=0;
let m= A.length;
console.log(m);
let n= B.length;
console.log(n);


function merge(A,B,m,n){
	while(i<m && j<n){
  	if(A[i]<B[j]){
    	C[k++] = A[i++];
    }
    else{
    	C[k++] = B[j++];
    }
  }
  /* if( m!=n){ */
  for(;i<m;i++){
  	C[k++] = A[i];
    
  }
  for(;j<n;j++){
  	C[k++] = B[j];
  }
  
  return C;
}
console.log(merge(A,B,m,n));