Auckland - Priority Queue
Recommendation |
Has Potential |
||||
Link |
http://www.cs.auckland.ac.nz/software/AlgAnim/heaps.html#p_queue_anim |
||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Woi Ang; John Morris |
||||
Institution |
University of Auckland |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Shows array and tree representations. Step-by-step explanations of what is happening, with bounce-along pseudocode. |
||||
Evaluation |
Rather unclear what this does. There is more going on than building a priority queue (heap). Values are going in and out, sort of like replacement selection in an external sort. At the detail level, its reasonably clear what is happening in terms of a value going into the tree, etc. The total presentation is long and tedious, however. |
||||
Step Control; Animation; Canned Data |
|||||
Lecture Aid; Self Study |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-11-06 |
||||
Last Visited |
2008-07-17 |
||||
Last Updated |
1998 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
