Advertisement
Guest User

Untitled

a guest
Nov 22nd, 2017
78
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.69 KB | None | 0 0
  1. #include "stdafx.h"
  2. #include <iostream>
  3. #include <string>
  4. #include <vector>
  5.  
  6. using namespace std;
  7.  
  8. int binary_search(int max, int min, int key) {
  9.  
  10. if (max < min)
  11. return -1;
  12.  
  13. char a;
  14.  
  15. cout << "Answer closer to the middle or further or equally?(y/n)";
  16. cin >> a;
  17.  
  18. int middle = min + (max - min)/ 2;
  19.  
  20. if (a == 'y') {
  21. return binary_search(key, min, middle);
  22. }
  23. if (a == 'n') {
  24. return binary_search(key, middle + 1, max);
  25. }
  26. else {
  27. return middle;
  28. }
  29. }
  30.  
  31.  
  32. int main()
  33. {
  34. int max;
  35. int min;
  36. int key;
  37. cin >> max;
  38. cin >> min;
  39. cin >> key;
  40.  
  41. binary_search(max, min, key);
  42. cout << binary_search << endl;
  43. system("pause");
  44. return 0;
  45. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement