merge sorted arrays js

mergesorted.js

// const {log} = console

// merge sorted
a = [0, 4, 6, 7];
b = [1, 2, 3, 4, 8];

function mergeSorted(x1, x2) {
  const out = [];
  const [l1, l2] = [x1.length, x2.length];
  let [i1, i2] = [0, 0];
  for(let i=0; i < l1+l2; i++) {
    if(i1 < l1 && i2 < l2) 
      if(x1[i1] < x2[i2])
      	out.push(x1[i1++])
      else
        out.push(x2[i2++])
   else if(i1 < l1)
     out.push(x1[i1++])
   else
     out.push(x2[i2++])
  }
  return out
}

mergeSorted(a, b)