Parallel Merge Sort Time Complexity - Quant Trader Interview Question
Difficulty: Medium
Category: Algorithms & Data Structures
Practice quant interview questions from top firms including Jane Street, Citadel, Two Sigma, DE Shaw, and other leading quantitative finance companies.
Topics: algorithms, data-structures, parallel-computing, merge-sort, time-complexity
Problem Description
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
Practice this medium trader interview question on MyntBit - the all-in-one quant learning platform with 200+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.