I found this quite interesting. Basically, given the following description: Binary search solves the problem [of searching within a pre-sorted array] by keeping track of a range within the array in ...

Wrote one like a month ago, actually.. I know you've all been on the edge waiting for an Ada contribution... Should handle an array with any index range (e.g. -2147483648 .. -2147483639). Takes value ...