Trakla - Merge Sort
Recommendation |
Not Recommended |
||||
Link |
http://www.cs.hut.fi/Research/TRAKLA2/exercises/IteratedMergeSort.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 |
Two versions of Merge are available: One labeled "iterative" and one labeled "recursive". User works through an exercise of swapping elements between the array and an auxilliary array to demonstrate proficiency at the mechanics of mergesort. |
||||
Evaluation |
As an exercise, this is too tedious, and the directions are unclear. The recursive version makes no sense at all. Stepping through the "model answer" for the iterative version helps demonstrate how Merge Sort works, but it is not particularly intuitive. |
||||
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. |
