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 | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 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 :).