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--;
}
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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--;
}
Name |
---|
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.