Trakla - Heap Sort
Recommendation |
Not Recommended |
||||
Link |
http://www.cs.hut.fi/Research/TRAKLA2/exercises/HeapSort.html |
||||
Delivery Method |
Java Application |
||||
License |
GPL |
||||
Language |
English |
||||
Author |
Ville Karavirta; Ari Korhonen; Lauri Malmi; Kimmo Stålnacke |
||||
Institution |
Helsinki University of Technology |
||||
Project |
|||||
Works |
Yes |
||||
Description |
User works through an exercise of swapping elements within the heap to demonstrate proficiency at the mechanics of mergesort. |
||||
Evaluation |
As an exercise, this is too tedious, and the directions are unclear. Stepping through the "model answer" provides no understanding of how the algorithm works because the granularity is to large (one step per max element removed), such that the user can't recognize what changed in the heap at each step. |
||||
Canned Data; Predictions |
|||||
Lecture Aid; Self Study; Lab Exercise |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2008-07-29 |
||||
Last Visited |
2008-07-29 |
||||
Last Updated |
2006-01-25 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
