int L = 0, R = 0;
while(L < R){
if(v[L] == x) cout << "I found it";
if(v[R] == x) cout << "I found it";
L++, R--;
}
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
2 | adamant | 163 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | TheScrasse | 147 |
7 | atcoder_official | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
int L = 0, R = 0;
while(L < R){
if(v[L] == x) cout << "I found it";
if(v[R] == x) cout << "I found it";
L++, R--;
}
Название |
---|
Actually you could have done something similar on a graph, and it will reduce the time complexity by a lot if it's a very big graph with a high branching factor. This has its own name — "Bidirectional Search".
I have a more superior idea
Would you please explain it?
it's an nlog(n) search method, whereas binary search is only log(n). Basically it's n times better than binary search
Big L if
RAND_MAX
is 32767 andx
is located on index 32768That's why you should buy a lottery ticket.