So im exploring what a binary search is, and I just would like a few opinions on what I belive a binary search is.

So the way I see it, a binary search is nothing more then an algorithm that starts at the middle of an ORDERED list(array or otherwise), then searchs only the other half depending on if the value you want is lower or higher then the middle element in your list. Am I missing anything? Thanks

Thats basically it. It divides the problem by 1/2 each time until it either
finds a solution or is out of bounds.