Tournament sort
id:
tournament-sort-168-17749571
title:
Tournament sort
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Tournament_sort
date created:
2009-08-26T12:58:02Z
date modified:
2024-08-31T03:59:33Z
main entity:
{"identifier":"Q7829328","url":"https://www.wikidata.org/entity/Q7829328"}
image:
fields total:
13
integrity:
14