Getting Started
User Guide
API Reference
Project
Defined in File BinarySearch.h
binarySearch()
: the place of v in the sorted A, or -1; trace( i , j ,
m ) on each call that examines A[ m ]
A is sorted
the result is -1 if and only if v is not in A