Algorithms & Data Structures
Intermediate
Pro
Sort and Search
Build sorting and selection algorithms from scratch, then bend them to find the kth answer fast
25 min read
0 views
Learn how merge sort, quicksort, quickselect, and three-way partitioning work under the hood, and use them to sort a linked list in place, implement a general array sort, find the kth largest element in average O(n), and sort a three-valued array in a single pass.