I am having trouble understanding why the bool search function is working the way it does.
I had gone through the Section for Week 3. While I understand the logic of binary search, I don't understand how the computer is exactly "searching." Sure, we delineated bounds in different cases relative to the middle value, but those boundaries aren't even passed into the function.
How does the computer know to look within the bounds of a list if there isn't some algorithm that tells the computer to look at the elements, one at a time?
Since that is how a computer "searches." Although I understand that binary search narrows down the elements in the list being examined, I thought that the searching would still involve multiple linear searches with smaller n. All in all, there is no explicit mention of a searching algorithm within the function declaration itself.