merging two sorted arrays code example
Example 1: In-place merge two sorted arrays
def merge(X, Y):
m = len(X)
n = len(Y)
for i in range(m):
if X[i] > Y[0]:
temp = X[i]
X[i] = Y[0]
Y[0] = temp
first = Y[0]
k = 1
while k < n and Y[k] < first:
Y[k - 1] = Y[k]
k = k + 1
Y[k - 1] = first
Example 2: 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]
// }
Example 3: merge two sorted lists python
from heapq import merge
test_list1 = [1, 5, 6, 9, 11]
test_list2 = [3, 4, 7, 8, 10]
print ("The original list 1 is : " + str(test_list1))
print ("The original list 2 is : " + str(test_list2))
res = list(merge(test_list1, test_list2))
print ("The combined sorted list is : " + str(res))
Example 4: merge two sorted list in python
sorted(l1+l2)