Advertisement
heian

Untitled

May 25th, 2019
100
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.50 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. ///cautare biara implementata recursiv
  6. int CautBin(int st, int dr, int a[], int x)
  7. {
  8. if(st>dr)
  9. return -1;
  10. int mijl = (st+dr)/2;
  11. if(a[mijl]==x)
  12. return mijl;
  13. if(a[mijl] < x)
  14. return CautBin(mijl+1, dr, a, x);
  15. //a[mijl] > x
  16. return CautBin(st, mijl-1, a, x);
  17. }
  18.  
  19. int main()
  20. {
  21. int a[] = {0,1,2,3,3,6,9,10,22,50};
  22. // 1 2 3 4 5 6 7 8 9
  23. cout<<CautBin(1,9,a,-22);
  24. return 0;
  25. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement