Think about using binary search and mergesort, or devising your own divide-and-conquer algorithm. Implement and test your algorithm.
Floor and ceiling. Given a sorted array of Comparable items, write functions floor() and ceiling () that return the index of the largest (or smallest) item not larger (or smaller) than an argument item in logarithmic time.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.