Binary search bounds 1

Computer Science Level pending

Say you want to search the list \([0,2,5,5,9,10,11,12,14,15]\) to see if the value 13 is in the list using the binary search algorithm described here.

Which of the following values in the list (not the indices) will never be a value of "first" in the search for 13?

Hint: If you get stuck, trying running the code from the binary search page and add a few useful print statements to keep track of the value of the array at index "first."

×

Problem Loading...

Note Loading...

Set Loading...