About this question
Medium · Algorithms & Data Structures · Quant Trader interview question · algorithms, data-structures, parallel-computing, merge-sort, time-complexity
You are tasked with optimizing a large-scale data processing pipeline at a high-frequency trading firm. A key component of this pipeline involves sorting massive datasets using a parallel merge sort algorithm. The dataset contains $n$ elements, and you have access to $p$ processors to perform the sorting in parallel. Assume the merge sort algorithm is optimally parallelized. What is the overall time complexity of this parallel merge sort algorithm, considering both the work (total operations