Callaghan-Hattingh / rightmost_value_in_sorted_array_1

Find the rightmost value less than or equal to target in arr sorted array.

A basic Algorithm

That is designed to find the rightmost value less than or equal to target in arr sorted array or -1 if error.

The algorithm makes use of the fact that the array is sorted and binary search.