fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int main() {
  5. vector<int> arr={11,12,13,14,15,16,17,18};
  6. int k=15;
  7. // for(int i=0;i<arr.size();i++){ //linear search
  8. // if(arr[i]==15){
  9. // cout<<"wow"<<endl;
  10. // }else{
  11. // cout<<"."<<endl;
  12. // }
  13. // }
  14.  
  15. //for binary search array is always sorted.. O(log2N)
  16. int start=0,end=arr.size()-1;
  17. int mid=(start+end)/2;
  18. while(start<=end){
  19. if(arr[mid]==k){
  20. cout<<"found: "<<mid<<endl;
  21. break;
  22. }else if(arr[mid]>k){
  23. end=mid-1;
  24.  
  25. cout<<"bada"<<endl;
  26.  
  27. }else{
  28. start=mid+1;
  29. cout<<"chota"<<endl;
  30. }
  31. mid=(start+end)/2;
  32.  
  33. }
  34. return 0;
  35. }
Success #stdin #stdout 0.01s 5320KB
stdin
Standard input is empty
stdout
chota
bada
found: 4