[C++] 이진탐색(binary search) 구현

#include <iostream>
#include <vector>

using namespace std;

vector<int> A;

int binary(int t, int start, int end)
{
    int mid = (start + end)/2;

    if (start > end)return 0;
    if(t == A[mid])return 1;
    else if(t > mid)start = mid;
    else end = mid;

    binary(t, start+1, end);
    return 0;
}
int main()
{
    int n;
    cin >> n;
    for(int i = 0; i < n; i++) {
        int ipt;
        cin >> ipt;
        A.push_back(ipt);
    }
    int target;
    cin >> target;
    cout <<binary(target, 0, n-1);
}