Recommendation

Has Potential

Link

http://www.cs.hut.fi/Research/TRAKLA2/exercises/RecursiveQuicksort.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

Trakla2

RelationshipToProject

PartOfProject

Works

Yes

Description

User works through an exercise demonstrating proficiency at determining bounds of the subarrays that are called in the Quicksort recursion stack. During the process, the user will have sorted the elements. Pseudocode is provided.

Evaluation

The idea of having students demonstrate proficiency actively is good. But this implementation does not work well for two reasons. First, the instructions are extremely cryptic, and it takes far too much effort to figure out the mechanics for how to satisfy the exercise. Once that hurdle is overcome, it can get rather tedious to go through all of this, though that part might not be too bad if so much effort hadn't been expended already in figuring out what you are supposed to do. A bigger problem is that the exercise is focusing on mechanics a great deal. Its not clear how well this gets the concepts of Quicksort across. In any case, this AV does not stand on its own, instructors will need to supplement it with a lecture or textbook.

ActivityLevel

Canned Data; Predictions

GoodFor

Lecture Aid; Self Study; Lab Exercise

Screenshots

Videos

References

HowToUse

First Visited

2008-07-26

Last Visited

2008-07-26

Last Updated

2006-01-25

Topic

QuickSort

Community

Edit

You may edit this entry if you have an account.