Introduction
The Heap sort visualization applet is a tool for beginning computer science
students to observe the inner workings of the heap sort sorting algorithm
at an abstract level. The virtue of the heap sort algorithm, lies with the fact
that it's complexity always remains proportional to O(nlogn) even
in the worst case, given n array elements to sort. Ironically, the worst case
scenario for the heap sort algorithm happens to be an already sorted array, which
is obviously true when one considers the nature of the algorithm.
Before delving into the Java based applet, be sure to check out this
short primer on the heap sort algorithm if you are
somewhat unfamiliar with it. You may then wish to first go through the
user's guide to learn the applet's interface
and how it works. Finally, check out the visualization
applet itself to dissect this truly elegent sorting algorithm.
Technical documentation is also available for anyone
wanting to see how this applet was designed and implemented in the Java
language. From there, the source code is
explained.
Developed by
Mike Copley, UH for ICS 665 (Prof. J. Stelovsky)