Lower and Upper Bound - Binary Search
I Lower Bound
Problem
You are given an array 'arr' sorted in non-decreasing order and a number 'x'.
You must return the index of lower bound of 'x'. (link)
Note:
For a sorted array 'arr', 'lower_bound' of a number 'x' is defined as the smallest index...
chetan77.hashnode.dev4 min read