Python: Combine two given sorted lists using heapq module

Last update on April 19 2025 12:58:34 (UTC/GMT +8 hours)

Merge Sorted Lists with Heapq

Write a Python program to combine two sorted lists using the heapq module.

Sample Solution:

Python Code:

# Import the 'merge' function from the 'heapq' module, which is used to merge two sorted lists.
from heapq import merge

# Create two sorted lists 'nums1' and 'nums2'.
nums1 = [1, 3, 5, 7, 9, 11]
nums2 = [0, 2, 4, 6, 8, 10]

# Print a message indicating the original sorted lists.
print("Original sorted lists:")
print(nums1)
print(nums2)

# Print a message indicating that the two sorted lists are being merged.

print("\nAfter merging the said two sorted lists:")
# Use the 'merge' function to merge the two sorted lists, convert the result to a list, and print it.
print(list(merge(nums1, nums2)))

Sample Output:

Original sorted lists:
[1, 3, 5, 7, 9, 11]
[0, 2, 4, 6, 8, 10]

After merging the said two sorted lists:
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]

Flowchart:

For more Practice: Solve these Related Problems:

Write a Python program to merge k sorted lists into one sorted list using the heapq module efficiently.
Write a Python program to merge two sorted lists in descending order using the heapq module.
Write a Python program to merge two sorted lists while removing duplicate values using the heapq module.
Write a Python program to merge two sorted lists with heapq and then compute the median of the merged list.

Go to:

Previous: Write a Python program to find the maximum and minimum values in a given list within specified index range.
Next: Write a Python program to check if a given element occurs at least n times in a list.

Python Code Editor: