Webopedia on Google+Webopedia on TwitterWebopedia on FacebookTech Bytes Blog
Main » TERM » H »

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.







TECH RESOURCES FROM OUR PARTNERS
DID YOU KNOW?
5 Best Valentines Day Ideas for Open Source Romantics

Because nothing says "I Love You" Like an open source app. Read More »

Guarding your Data against Cyber Attacks

In this new era of heightened stakes comes an increased need for a comprehensive security strategy. Let's take a look at how cyber-threats have... Read More »

The Great Data Storage Debate: Is Tape Dead?

Tape clearly is on the decline. But remember, legacy systems can hang for a shockingly long time. Read More »

QUICK REFERENCE
Network Fundamentals Study Guide

A network is a group of two or more computer systems or devices, linked together to share resources, exchange files and electronic communications.... Read More »

Computer Architecture Study Guide

This Webopedia  study guide describes the different parts of a computer system and their relations. Read More »

Webopedia Polls

The trend for the past two years has been for shoppers to spend more online during the holiday season. How do you typically shop for holiday... Read More »