Tree sort
Sorting algorithm that builds a binary search tree and then traverses the tree
A tree sort is a sort algorithm that builds a binary search tree from the elements to be sorted, and then traverses the tree (in-order) so that the elements come out in sorted order. Its typical use is sorting elements online: after each insertion, the set of elements seen so far is available in sorted order.
Nº Q863521 ★
Comum · Saberes
Tree sort
Sorting algorithm that builds a binary search tree and then traverses the tree
A tree sort is a sort algorithm that builds a binary search tree from the elements to be sorted, and then traverses the tree (in-order) so that the elements come out in sorted order. Its typical use is sorting elements online: after each insertion, the set of elements seen so far is available in sorted order.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
A tree sort is a sort algorithm that builds a binary search tree from the elements to be sorted, and then traverses the tree (in-order) so that the elements come out in sorted order. Its typical use is sorting elements online: after each insertion, the set of elements seen so far is available in sorted order. Tree sort can be used as a one-time sort, but it is equivalent to quicksort as both recursively partition the elements based on a pivot, and since quicksort is in-place and has lower overhead, tree sort has few advantages over quicksort. It has better worst case complexity when a self-balancing tree is used, but even more overhead.
Texto: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: Mathgorges (Public domain) ·
Cartas próximas
-
Árvore binária de busca
Nº Q623818 ★★
Sem ofertas
-
Árvore binária
Nº Q380172 ★★★
Sem ofertas
-
Selection sort
Nº Q220831 ★★
Sem ofertas
-
P
Powersort
Sorting algorithm
Nº Q136399159 ★
Sem ofertas
-
Insertion sort
Nº Q117241 ★★
Sem ofertas
-
C
Counting sort
Nº Q1124964 ★
Sem ofertas