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--;
}
A superior binary search method
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--;
}