#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> arr={11,12,13,14,15,16,17,18};
int k=15;
// for(int i=0;i<arr.size();i++){ //linear search
// if(arr[i]==15){
// cout<<"wow"<<endl;
// }else{
// cout<<"."<<endl;
// }
// }
//for binary search array is always sorted.. O(log2N)
int start=0,end=arr.size()-1;
int mid=(start+end)/2;
while(start<=end){
if(arr[mid]==k){
cout<<"found: "<<mid<<endl;
break;
}else if(arr[mid]>k){
end=mid-1;
cout<<"bada"<<endl;
}else{
start=mid+1;
cout<<"chota"<<endl;
}
mid=(start+end)/2;
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCXZlY3RvcjxpbnQ+IGFycj17MTEsMTIsMTMsMTQsMTUsMTYsMTcsMTh9OwoJaW50IGs9MTU7CgkvLyBmb3IoaW50IGk9MDtpPGFyci5zaXplKCk7aSsrKXsgLy9saW5lYXIgc2VhcmNoCgkvLyAJaWYoYXJyW2ldPT0xNSl7CgkvLyAJCWNvdXQ8PCJ3b3ciPDxlbmRsOwoJLy8gCX1lbHNlewoJLy8gCQljb3V0PDwiLiI8PGVuZGw7CgkvLyAJfQoJLy8gfQoJCgkvL2ZvciBiaW5hcnkgc2VhcmNoIGFycmF5IGlzIGFsd2F5cyBzb3J0ZWQuLiAgTyhsb2cyTikKCWludCBzdGFydD0wLGVuZD1hcnIuc2l6ZSgpLTE7CglpbnQgbWlkPShzdGFydCtlbmQpLzI7Cgl3aGlsZShzdGFydDw9ZW5kKXsKCQlpZihhcnJbbWlkXT09ayl7CgkJCWNvdXQ8PCJmb3VuZDogIjw8bWlkPDxlbmRsOwoJCQlicmVhazsKCQl9ZWxzZSBpZihhcnJbbWlkXT5rKXsKCQkJZW5kPW1pZC0xOwoJCQkKCQkJY291dDw8ImJhZGEiPDxlbmRsOwoJCQkKCQl9ZWxzZXsKCQkJc3RhcnQ9bWlkKzE7CgkJCWNvdXQ8PCJjaG90YSI8PGVuZGw7CgkJfQoJCW1pZD0oc3RhcnQrZW5kKS8yOwoJCgl9CglyZXR1cm4gMDsKfQ==