Presented as a series of slides, with pseudocode. The animation demonstrates the course of a binary search and shows the source code. To better understand the procedure the current code line is highlighted. Additionally the source code was annotated showing which program line corresponds to which part of the divide and conquer strategy. In addition to the AV linked above, there are other examples of binary search are provided in the complete Animal package.

Not so clear what is going on. A major problem is that the right and left subarray bounds variables are not visually integrated with the array.

For detailed instructions on how to install Animal and run Animal AVs, see: http://www.algoanim.info/Animal2/?q=node/290. Once you have installed the Animal .jar file and downloaded/unpacked the .zip file of Animal animations, you are now ready to run Animal. Run the .jar file to start Animal. Then go to the "Open" menu item, and browse to where you put the animal animations you got in the .zip file. Pick this AV from the list. You can then step through the animation, or use "kiosk mode" to have the steps fed to you at a constant pace.