Trakla - Binary Search
Recommendation |
Recommended |
||||
Link |
http://www.cs.hut.fi/Research/TRAKLA2/exercises/BinarySearch.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 demonstrating proficiency at determining which positions in the array are visited during a binary search. Pseudocode is provided to work from. |
||||
Evaluation |
Excellent exercise. The one flaw with this AV is that the user has to do some calculation (adding array indices and dividing by two to decide what is visited next). That can get tedious. |
||||
Canned Data; Predictions |
|||||
Lecture Aid; Self Study; Lab Exercise |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2008-07-25 |
||||
Last Visited |
2008-07-25 |
||||
Last Updated |
2006-01-25 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
