This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License
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.
| Property | Value |
|---|---|
| dbo:abstract |
|
| dbo:wikiPageExternalLink | |
| dbo:wikiPageID |
|
| dbo:wikiPageLength |
|
| dbo:wikiPageRevisionID |
|
| dbo:wikiPageWikiLink | |
| dbp:averageTime |
|
| dbp:class | |
| dbp:data | |
| dbp:time |
|
| dbp:wikiPageUsesTemplate | |
| dcterms:subject | |
| gold:hypernym | |
| rdf:type | |
| rdfs:comment |
|
| rdfs:label |
|
| owl:sameAs | |
| prov:wasDerivedFrom | |
| foaf:isPrimaryTopicOf | |
| is dbo:wikiPageDisambiguates of | |
| is dbo:wikiPageWikiLink of | |
| is foaf:primaryTopic of |