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.
|Creator(s):||Ville Karavirta, Lauri Malmi, Kimmo St'lnacke, Ville Karavirta|
|Publisher:||Helsinki University of Technology|
|Subject:||Search Algorithms, BinarySearch, binary search|
|Rights:||Licensed under GPL|
|Audience:||Educator, Learner, Professional/Practitioner, Researcher|
|Education Level:||Higher Education|
|Material Type:||Instructional Material, Tool|