Computing and Information Technology Interactive Digital Educational Library


Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item:

Title: heapsort
Issue Date: 2-Apr-2004
Publisher: PlanetMath
Abstract: ... 0.4in ... [4]{ ... Algorithm ... #1 ... Input : #3 ... Output : #4 ... }{} ... [6][h]{ ... Note that the algorithm given is based on a top-down heap insertion algorithm. It is possible to get better results through bottom-up heap construction. Each step of each of the two ... for loops in this algorithm has a runtime complexity of ... . Thus overall the heapsort algorithm is ... . Heapsort is not quite as fast as quicksort in general, but it is not much slower, either. Also, like quicksort, heapsort is an in-place sorting algorithm, but not a stable sorting algorithm. Unlike quicksort, its performance is guaranteed, so despite the ordering of its input its worst-case complexity is ... . Given its simple implementation and reasonable performance, heapsort is ideal for quickly implementing a decent sorting algorithm.
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

File SizeFormat

All items in DSpace are protected by copyright, with all rights reserved.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback