tag

#tournament-tree

2 pages tagged

Wiki › Algorithms › 01. Searching and Sorting › 7. Divide and Conquer Sorting ›

Tournament Merge Sort

Tournament Merge Sort Tournament merge sort uses a tournament tree to merge sorted sequences. Each element competes in a structured tree, and the winner at the root is the smallest element. After removing the winner, the tree is updated to find the next smallest. It is conceptually similar to multiway merge, but uses a tournament structure instead of a heap. Problem Given an array $A$ of length $n$, reorder it...

Wiki › Algorithms › 01. Searching and Sorting › 9. Partial, Online, and Adaptive Sorting ›

Tournament Tree Partial Sort

Tournament Tree Partial Sort Tournament tree partial sort uses a tournament tree to repeatedly extract the next smallest or largest element. It is useful when only a sorted prefix of length ( k ) is needed. You use it when you want partial sorted output with predictable comparison structure. Problem Given an array ( A ) of length ( n ) and an integer ( k ), output the smallest...