Icon New game New game

Algorithm for binary search

Fill in the Blanks

Fill in the blanks for an algorithm for a binary search

Download the paper version to play

Recommended age: 14 years old
4 times made

Created by

United Kingdom

Top 10 results

There are still no results for this game. Be the first to stay in the ranking! to identify yourself.
Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

  1. time
    score
  1. time
    score
time
score
time
score
 
game-icon

Fill in the Blanks

Algorithm for binary searchOnline version

Fill in the blanks for an algorithm for a binary search

by James
1

Initially greater empty midpoint ordered searching change focus item range middle

Take an list of data and an that is being searched for ?
Maintain a of items where the search item might be found . ?
, set the range to be the entire list . ?
Repeat steps a - e until you find the item you are for or there are no more items to check ( the range is ) : ?
Find the item in the of the range ( the item ) . ?
Compare the midpoint item to the item you are searching for . ?
If the midpoint item is equal to the search item , then stop searching . ?
Otherwise , if the midpoint item is less than than the search item , the range to focus on the items after the midpoint . ?
Otherwise , if the midpoint item is than than the search item , change the range to on the items before the midpoint . ?

educaplay suscripción