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
  • 1

    private cloud project

    Companies initiate private cloud projects to enable their IT infrastructure to become more capable of quickly adapting to continually evolving...

    Read more »

  • 2

    cloud backup

    A cloud backup (cloud computer backup) refers to backing up data to a remote, cloud-based server. As a form of cloud storage, cloud backup data is...

    Read more »

  • Click Here!

Connect with Webopedia

  • Android Apps for Remote Computer Access

    Remote access is useful when you need to collaborate with co-workers, help a friend with PC problems or grab files from your desktop.

    Read More »

Did You Know? Archive »

  • Quick Reference Archive »