Can someone please explain me lower_bound and upper_bound and how they are used in sorted array? Please explain in depth.
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
Can someone please explain me lower_bound and upper_bound and how they are used in sorted array? Please explain in depth.
Name |
---|
int* ptr = lower_bound(a, a + n, k);
returns the pointer to the first element in
a
that is larger than or equal to kint* ptr = upper_bound(a, a + n, k);
returns the pointer to the first element in
a
that is larger than kYou can use the following to get the index. This also means "how many elements in a are smaller than k"
int index = lower_bound(a, a + n, k) - a;
Don't forget that
std::map
andstd::set
have their ownlower_bound
andupper_bound
function.According to cplusplus.com
lower_bound(a,a+n,k)
returns pointer to the first element, where k can be inserted.upper_bound(a,a+n,k)
returns pointer to the last element, where k can be inserted :).