BS-2. Implement Lower Bound and Upper Bound | Search Insert Position | Floor and Ceil

Transcript

so what is lower bound the definition goes as the smallest index yes the smallest index such that the number at that index is greater than equal to the given number let's take an example so this is a sorted array again the array has to be sorted for lower bound to be implemented imagine I give you X as eight if I give you X as 8 I can say the small... Read More