Advertisement
Guest User

Cautare Binara

a guest
Jan 21st, 2020
122
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.41 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int cauta(int v[], int n, int x){
  5.     int st=0;
  6.     int dr=n-1;
  7.     while(st<=dr)
  8.     {
  9.         int mid = (st+dr)/2;
  10.         if (v[mid]==x) return mid;
  11.         if (v[mid] < x) st = mid+1;
  12.         else dr = mid-1;
  13.     }
  14.     return -1;
  15. }
  16.  
  17. int main()
  18. {
  19.     int sir[13] = {1,3,5,6,7,9,10,12,13,15,18,19,20};
  20.     cout << cauta(sir, 13, 19) << endl;
  21.     return 0;
  22. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement