Sorting Algorithms (MergeSort, QuickSort) & Binary Heaps
Compare O(N log N) sorting algorithms (MergeSort, QuickSort), and build Binary Min-Heap Priority Queues supporting O(log N) insertion/extraction.
Sorting Complexity & Heap Structures
### Sorting & Priority Queues
- **MergeSort**: Divide-and-conquer algorithm guaranteeing $O(N log N)$ worst-case runtime using $O(N)$ auxiliary space.
- **QuickSort**: In-place partitioning algorithm with $O(N log N)$ average runtime.
- **Binary Min-Heap**: Complete binary tree satisfying the heap property (parent node $le$ child nodes), allowing $O(1)$ min lookup and $O(log N)$ extraction.
