Sorting: Merge Sort & Quickselect

Build divide-and-conquer sorting from the ground up: merge two sorted lists, grow that into merge sort, implement Lomuto partition for quicksort, reuse partition for O(n)-average quickselect (top-K queries), and finish with a stable key-based sort for ordering records. A practical toolkit for ordering data and answering k-th smallest queries.