i am using upperbound and lowerbound in c++ regularly but i don't know actual algorithm behind this??? Plzz help..
i am using upperbound and lowerbound in c++ regularly but i don't know actual algorithm behind this??? Plzz help..
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3390 |
| 6 | Um_nik | 3387 |
| 7 | tourist | 3384 |
| 8 | heuristica | 3322 |
| 9 | turmax | 3319 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | AmShZ | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | maroonrk | 134 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
It's a simple binary search.
http://www.cplusplus.com/reference/algorithm/upper_bound/
Actually i m not able to understand this step. std::advance (it,step);
bcoz this step is linear and this will increase it's complexity..?
its just equal to it+step in our case, works for O(1)
It's O ( 1 ) when you have random access iterators, on non random access iterators it has linear complexity.
http://www.cplusplus.com/reference/algorithm/lower_bound/