Tournament sort is a sorting algorithm that improves on the naive selection sort by using a priority queue, structured as a tournament, to find the next element in sorted order. Where naive selection sort takes time proportional to the number of remaining elements to select each next element, tournament sort takes only logarithmic time per selection after an initial linear-time setup of the tournament, and it is considered a variation of heapsort.
Facts
Time Complexity
Time Complexity (category)Linearithmic Time -- O(n log n) 1 Connections
In Field
Source Tournament Sort (Wikipedia)
Sources
1. Tournament Sort (Wikipedia)
Lead section
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)).
In Group: Comparison Sorting Algorithms, Lead
Tournament sort is a sorting algorithm. It improves upon the naive selection sort by using a priority queue
In Field: Algorithms and Complexity Theory, Lead sentence
Tournament sort is a sorting algorithm.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.