BinarySearch[l, k] searches sorted list for key and gives the position of containing , if is present in . Otherwise, if is absent in , the function returns where falls between the elements of in positions and .
BinarySearch[l, k, f] gives the position of in the list obtained from by applying to each element in .