1 Answers
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 operations to select the next element of n elements; in a tournament sort, it takes O operations ]. Tournament sort is a variation of heapsort.
4 views
Answered