Wikis›01. Searching and Sorting›9. Partial, Online, and Adaptive SortingTournament Tree Partial SortUse a tournament tree to extract the smallest or largest k elements in sorted order without fully sorting the input.
Wikis›01. Searching and Sorting›7. Divide and Conquer SortingTournament Merge SortMerge-based sorting algorithm that uses a tournament tree to repeatedly select the next smallest element.