Binary Search – Is this correct? and how to get position of search term
I am a beginner to programming. I have three questions about my binary search code I wrote (in Python):
(1) When I compared my code to the ones I found on the net, I see that everyone uses low and high values parameters. Wondering if mine can have errors that I am not seeing or is it just that the high/low parameters make the code more readable? I thought mine follows the recursive way of thinking (at least for me).