Data Structure Visualization - Heap
Recommendation |
Has Potential |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
Unlicensed Sourcecode |
||||
Language |
English |
||||
Author |
David Galles |
||||
Institution |
University of San Francisco |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Users can enter data values into a min-heap, and remove the smallest value. Alternatively, user can have an array of 32 values generated, and then watch an animation of the build process. |
||||
Evaluation |
No code or explanation of what is happening. When a value is inserted, user then watches an animation of the insertion process. This can make it hard to follow what is happening. |
||||
Animation Only; User Data; Canned Data |
|||||
Lecture Aid; Debugging |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-09-01 |
||||
Last Visited |
2008-07-01 |
||||
Last Updated |
2006-04-05 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
