LeetCode 324: Wiggle Sort II
A clear explanation of Wiggle Sort II using sorting, median splitting, and virtual indexing.
Tag
Quickselect
6 notes
LeetCode 215: Kth Largest Element in an Array
A clear explanation of finding the kth largest element using sorting, a min-heap, and Quickselect.
Quickselect
Select the k-th smallest element in an unsorted array using partitioning.
Top K by Quickselect
Find the k largest elements using partition-based selection in linear time.
Randomized Quickselect
Quickselect with random pivot selection to achieve robust expected linear time.
6.13 Quickselect
Find the element at a given rank using quicksort's partition step but recursing into only one side, achieving expected linear time.