Examples:
Input: arr1 = [1, 3, 4, 5] arr2 = [2, 4, 6, 8] Output: arr3 = [1, 2, 3, 4, 4 , 5, 6, 8] Input: arr1 = [5, 8, 9] arr2 = [4, 7, 8] Output: arr3 = [4, 5, 7, 8, 8, 9]
This problem has an existing solution, please refer to the link Output: This module provides an implementation of the heap queue algorithm, also known as the priority queue algorithm. This article courtesy of Shashank Mishra (Gullu) . If you are as Python.Engineering and would like to contribute, you can also write an article using contribute.python.engineering or by posting an article contribute @ python.engineering. See my article appearing on the Python.Engineering homepage and help other geeks. Please post comments if you find anything wrong or if you’d like to share more information on the topic discussed above. # Function to combine two sorted arrays from heapq import merge def mergeArray (arr1, arr2): return list (merge (arr1, arr2))
# Driver function if __ name__ = = "__ main __" arr1 = [ 1 , 3 , 4 , 5 ] arr2 = [ 2 , 4 , 6 , 8 ] print mergeArray (arr1, arr2) [1, 2, 3, 4, 4, 5, 6, 8]
Module properties heapq?
To create a heap, use a list initialized with [], or you can convert a populated list to a heap using the heapify () function. The following functions are provided:
