#include<iostream>
using namespace std;
int binary_search(int* nums,int num, int l, int r)
{
int mid_loc = (l + r) / 2;
if (nums[mid_loc] == num)
return mid_loc;
else if (nums[mid_loc] > num)
binary_search(nums, num, l, mid_loc);
else
binary_search(nums, num, mid_loc, r);
}
int main()
{
int n;
cout << "input nu" << endl;
cin >> n;
int * nums=(int*)malloc(sizeof(int));
for (int i = 0; i < n; i++)
{
int temp;
cin >> temp;
nums[i] = temp;
}
int num;
cout << "input num" << endl;
cin >> num;
int loc;
loc=binary_search(nums,num,0,n-1);
cout << "loc=" << loc << endl;
return 0;
}
using namespace std;
int binary_search(int* nums,int num, int l, int r)
{
int mid_loc = (l + r) / 2;
if (nums[mid_loc] == num)
return mid_loc;
else if (nums[mid_loc] > num)
binary_search(nums, num, l, mid_loc);
else
binary_search(nums, num, mid_loc, r);
}
int main()
{
int n;
cout << "input nu" << endl;
cin >> n;
int * nums=(int*)malloc(sizeof(int));
for (int i = 0; i < n; i++)
{
int temp;
cin >> temp;
nums[i] = temp;
}
int num;
cout << "input num" << endl;
cin >> num;
int loc;
loc=binary_search(nums,num,0,n-1);
cout << "loc=" << loc << endl;
return 0;
}