Trakla - Heap Sort
| Collection: | AlgoViz |
| Source: | http://algoviz.org/node/1215 |
| Format: | Java Application |
Recommendation: Not Recommended.
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.
| Creator(s): | Ari Korhonen, Lauri Malmi, Kimmo St'lnacke, Ville Karavirta |
| Publisher: | Helsinki University of Technology |
| Subject: | N log N sorts, heapsort |
| Relation: | Trakla2 |
| Language: | english |
| Rights: | Licensed under GPL |

