出典:Wikipedia
出典:『Wikipedia』 (2011/04/28 02:40 UTC 版)
Tournament sort is a sorting algorithm. It improves upon the naive selection sort by using a priority queue to find the next element in the sort. In the naive selection sort, it takes O(n) operations to select the next element of n elements; in a tournament sort, it takes
operations (after building the initial tournament in O(n)). Tournament sort is a variation of heapsort.