Javascript Algorithm:Merge two sorted Arrays

function merge(left, right) {

var i = 0, j = 0;

var result = []

while (i < left.length && j < right.length) {

if (left[i] < right[j]) {

result.push(left[i])

i++

} else {

result.push(right[j])

j++

}

}

if (i < left.length) {

result.push(...left.slice(i));

}

if (j < right.length) {

result.push(...right.slice(j));

}

    //return result.concat(left.slice(i)).concat(right.slice(j))

return result;

}

var left = [4, 67, 89, 100]

var right = [6, 34, 68, 78, 90, 95, 103]

var merged = merge(left, right)

console.log("merged", merged)