heapsort (Q474095)

worst-case optimal in-place comparison sorting algorithm based on the heap data structure

Language	Label	Description	Also known as
English	heapsort	worst-case optimal in-place comparison sorting algorithm based on the heap data structure

Statements

instance of

sorting algorithm

1 reference

imported from Wikimedia project

English Wikipedia

image

Sorting heapsort anim.gif
280 × 214; 274 KB

media legend

Une exécution de l'algorithme du tri par tas (Heapsort) trie une partie des valeurs permutées au hasard. Dans un premier temps, les éléments sont réarrangés pour respecter les conditions de tas. Avant le tri à proprement parler, la structure de l'arbre en tas est montrée brièvement par l'illustration. (French)

A run of heapsort sorting an array of randomly permuted values. In the first stage of the algorithm the array elements are reordered to satisfy the heap property. Before the actual sorting takes place, the heap tree structure is shown briefly for illustration. (English)

1 reference

imported from Wikimedia project

1 reference

discoverer or inventor

J. W. J. Williams

0 references

time of discovery or invention