Heapsort facts for kids
Heap sort or heapsort is a sorting algorithm. It was presented in 1964, and helped make a data structure known as heap popular. Heapsort divides the input into a sorted, and an unsorted region. It then takes the largest element from the unsorted region and inserts it into the sorted region. The unsorted region is kept as a heap, which allows to quickly find the largest element. Heapsort is not stable. It has a worst-case complexity of O(n*log(n)).
Images for kids
-
An example on heapsort.
See also
In Spanish: Heapsort para niños
Black History Month on Kiddle
Famous African-American Scientists:
 | Charles R. Drew |
 | Benjamin Banneker |
 | Jane C. Wright |
 | Roger Arliner Young |
All content from Kiddle encyclopedia articles (including the article images and facts) can be freely used under Attribution-ShareAlike license, unless stated otherwise. Cite this article:
Heapsort Facts for Kids. Kiddle Encyclopedia.