Lafore's Priority Queue
Recommendation |
Not Recommended |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Robert LaFore |
||||
Institution |
None |
||||
Project |
LaFore's Book |
||||
Works |
Yes |
||||
Description |
Very simple priority queue demonstration. This is not a heap-based priority queue, but merely a sorted queue that inserts new elements by swapping elements from the front. |
||||
Evaluation |
Strengths: Colored, and pseudocode is provided as the visualization is stepped through. Weaknesses: No "step" button, the operation button must be clicked multiple times to step through. This is a problem because if you don't stop at the end of an insert (which is hard to recognize), a new copy of the same record will be inserted. |
||||
|
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-08-30 |
||||
Last Visited |
2008-06-16 |
||||
Last Updated |
2002 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
