Trakla - Counting Methods and Radix/Exchange Sort
|
- Works?
- Yes
- Delivery Method(s)
- Java Application
- Project
- TRAKLA2
- Project Relationship
- Part of project
- Language(s)
- English
- Ville Karavirta, Ari Korhonen, Lauri Malmi, Kimmo Stålnacke
- Institution(s)
- Aalto University
- Activity Level(s)
- Canned data, Predictions
- Source Code License
- Licensed under GPL
- First Published
- N/A
- Last Modified
- N/A
- Description
- User works through an exercise demonstrating proficiency at determining how a simple 1-digit binsort works. There is also a radix-exchange sort exercise at http://www.cs.hut.fi/Research/TRAKLA2/exercises/TrueRecursiveRadixExchan….
- Evaluation
- The usually excellent Trakla exercises fails to work well in this case. The Radix-Exchange exercise is a total mystery. The Counting method exercise shows a simple one-digit binsort. For some reason, the values of the elements being sorted are kept hidden, being revealed only as/when they are processed. This does not help much. The requirements for “solving” the exercise are unclear. The whole thing is rather tedious. The worst part is that the user is faced with a “can’t see the forest for the trees” situation - imitating a computer at too low a level does not necessarily translate into an integrated understanding of the algorithm itself.
- Usage Notes
- Field Report(s)
- References
- N/A
- AV of the Day
- No
- Score
- 15
