You are given two arrays one is sorted and the other is reverse sorted. The lengths are respectively n and m. To merge them into a single sorted array, we first reverse the second and then merge them together. The overall complexity is code example
Example: Write a function that takes in two sorted arrays and returns a new array with all elements sorted not using array method sort.
// const newSortArrays = (arr1, arr2) => {
// let output = [];
// while (arr1.length && arr2.length) {
// if (arr1[0] < arr2[0])
// output.push(arr1[0] < arr2[0] ? arr1.shift() : arr2.shift())
// }
// return [...output, ...arr1, ...arr2]
// }