Click here

heap sort

A sorting algorithm that works by first organizing the data to be sorted into a special type of binary tree called a heap. The heap itself has, by definition, the largest value at the top of the tree, so the heap sort algorithm must also reverse the order. It does this with the following steps:

1. Remove the topmost item (the largest) and replace it with the rightmost leaf. The topmost item is stored in an array.

2. Re-establish the heap.

3. Repeat steps 1 and 2 until there are no more items left in the heap.

The sorted elements are now stored in an array.

A heap sort is especially efficient for data that is already stored in a binary tree. In most cases, however, the quick sort algorithm is more efficient.



Top Terms

Connect with Webopedia

  • What is 250 GB Data Usage?

    What is 250 GB (250 gigabytes) and why is this phrase so popular? Webopedia explains what the phrase 250 GB means in reference to data storage...

    Read More »

Did You Know? Archive »

  • Quick Reference Archive »