Home > IB Computer Science 2014 > Binary search animation

Binary search animation

September 27, 2012 Leave a comment Go to comments

This presentation should give you a visual overview of what is happening during an iterative implementation of binary search on an array.

  • Notice that the array must be sorted in order to do binary search (why?)
  • Higher level should also look up the recursive implementation.
  • What is the time complexity of binary search? In other words, how many loops do you have to do for an array of N elements?

binary search of array animation


  1. No comments yet.
  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s