Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "stdafx.h"
- #include <iostream>
- #include <string>
- #include <vector>
- using namespace std;
- int binary_search(int max, int min, int key) {
- if (max < min)
- return -1;
- char a;
- cout << "Answer closer to the middle or further or equally?(y/n)";
- cin >> a;
- int middle = min + (max - min)/ 2;
- if (a == 'y') {
- return binary_search(key, min, middle);
- }
- if (a == 'n') {
- return binary_search(key, middle + 1, max);
- }
- else {
- return middle;
- }
- }
- int main()
- {
- int max;
- int min;
- int key;
- cin >> max;
- cin >> min;
- cin >> key;
- binary_search(max, min, key);
- cout << binary_search << endl;
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement