MER - maccergit/Rosalind GitHub Wiki

Merging two sorted arrays is pretty easy.

01

Direct approach - build a new array an element at a time, stepping through the source arrays, pulling the next largest element from whichever array has it. By the time we get to the end of both arrays, then we are done.

02

Python has a heapq library that can be leveraged to merge sorted lists (and the problem indicates we will need this functionality in a later problem).

03

Or, we can ignore the fact that the lists are already sorted and sort the entire mess. This works if the lists are not pre-sorted - but also misses the ability to take advantage of this fact.