Unit 1 lecture 3
Is there a bug in how guesses are being counted in the Bisection search example?
Surely the first value of ans counts as a guess too?
The code as given finds the root of 4 in zero guesses

Question

Unit 1 lecture 3 
Is there a bug  in how guesses are being counted in the Bisection search example? 
Surely the first value of ans counts as a guess too? 
The code as given finds the root of 4 in zero guesses

anonymous · Answer

depends on the spec, if it complies with the specification then it is not a bug, if there is no specification - you get to do whatever you want and it is not a bug.

anonymous · Answer

also, the answer is not the point of the code - the lecture is about "Termination, decrementing functions, exhaustive enumeration, brute force, while loop, for loop, approximation, specifications, bisection search" - oops there's that specifications word in there - did it mean the tolerance thingy?