Can we do Threading in Binary Search?
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
Can we do Threading in Binary Search?
Название |
---|
Probably not since binary search is inherently sequential, and threading isn't useful in competitive programming anyway since online judges that I know of run on a single core and/or count the sum of the times taken by all threads.
why not? In normal binary search, we divide our interval into 2 subintervals, run 1 check function and achieve time complexity
O(log_2(n))
. With threading, we can divide it into 3 subintervals and run 2 check functions in parallel so time complexity isO(log_3(n))
, etc.