Algorithms and Data Structures

Write a 1 or 2-page report on what is an optimal way of merging two sorted sequences (of length n) in a parallel / distributed setting. Get as close to optimal as possible assuming you have infinite parallel processors at your disposal. Analyze the worst-case complexity of your algorithm and present the results.