코딩테스트 백준 - 1920 수 찾기

#include <stdio.h>

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int GetBinarySearch(vector<int>& v, int findNumber)
{
	int left = 0;
	int right = v.size() - 1;

	while (left <= right)
	{
		int middle = (left + right) / 2;

		if (v[middle] > findNumber)
		{
			right = middle - 1;
		}
		else if (v[middle] < findNumber)
		{
			left = middle + 1;
		}

		else
		{
			return 1;
		}
	}
	return 0;
}

int BinarySearch(const vector<int>& v, int target, int left, int right)
{
	if (left > right)
	{
		return 0;
	}

	int middle = (left + right) / 2;

	if (v[middle] > target)
	{
		return BinarySearch(v, target, left, middle - 1);
	}

	else if (v[middle] < target)
	{
		return BinarySearch(v, target, middle + 1, right);
	}
	else
	{
		return 1;
	}
}

int main()
{
	int N;
	cin >> N;
	vector<int> v(N);

	for (int i = 0; i < N; i++)
	{
		cin >> v[i];
	}
	sort(v.begin(), v.end());
	int M;
	cin >> M;
	vector<int> answer(M);
	for (int i = 0; i < M; i++)
	{
		int num;
		cin >> num;
		answer[i] = BinarySearch(v, num, 0, v.size() - 1);
	}
	for (int i = 0; i < M; i++)
	{
		printf("%d\n", answer[i]);
	}
}