e/Tournament sort

Information
has gloss	eng: 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 O(\log \ n) operations (after building the initial tournament in O(n)). Tournament sort is a variation of heapsort.
lexicalization	eng: Tournament sort
instance of	(noun) an algorithm for sorting a list sorting algorithm