Can we do Threading in Binary Search?
# | 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 | 163 |
4 | TheScrasse | 159 |
5 | maroonrk | 154 |
5 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 145 |
10 | pajenegod | 144 |
Can we do Threading in Binary Search?
Name |
---|
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.