heap sort Last modified: Tuesday, March 12, 2002
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.
•E-mail this definition to a colleague• For internet.com pages about heap sort . Also check out the following links!	Programming algorithm binary tree bubble sort Give Us Your Feedback cheap sport Products : Top Store Offers: Mulholland  38.00The right golfer's tool to repair ball marks, conveniently housed in a sturdy all leather snapping case. Total Gym Direct  349.00Limited Time Offer! Take an additional $50 OFF when you enter Promo Code 10001 at checkout. Chuck Norris & Christie Brinkley. 30 Day Trial for only $1... Textbooks.com  15.50Get "Get Fit, Stay Fit" new for only $29.00 , or used for only $15.50 . available; visit Textbooks.com for more detail. Crutchfield  19.99Universal Mount holder for your plug-and-play satellite radios,includes "The Bug" dual holders and low-profile mount,simple installation with adhesive... SitStay.com  4.75Small, 3/8" wide, 11 "-13" long Designed for use with the Sure-Fit Harness (above) to restrain your dog while you drive. Attach to the bottom ring of ... Compare all matches: 1646724 Store Offers