搜索算法

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. const int SIZE = 105;
  4. int arr[SIZE] = {0,11,22,33,44,55,66,77,88,99};
  5. int brinary_search(int x){
  6.     int l= 0 , r = 9+1;
  7.     while(l+1 != r){
  8.         int mid = (l+r)/2;
  9.         if(x == arr[mid]){
  10.             return mid;
  11.         }else if(x > arr[mid]){
  12.             l = mid;
  13.         }else{
  14.             r = mid;
  15.         }
  16.     }
  17.     return -1;
  18. }
  19. int main(){
  20.     brinary_search(66);
  21.     return 0;
  22. }