upper bound and lower bound

PHOTO EMBED

Sun Mar 19 2023 18:59:52 GMT+0000 (Coordinated Universal Time)

Saved by @solve_karbe12 #c

int a[]={1,2,3,4,5};
  bool res=binary_search(a,a+5,20);
  int ind=lower_bound(a,a+5,3)-a;
  int indi=upper_bound(a,a+5,3)-a;
  cout<<indi<<endl;
content_copyCOPY

tc=logn similar binarysearch lower return index of that element or next gratem element upper bound return always next grater element index