作业3 两种查找方法

#include<bits/stdc++.h>//万能头文件，包含c++所有头文件 
using namespace std;
const int N = 1e3;
int n, a[N],cnt;

//顺序查找
void sequenSearch(int x) {
	int i=0;
	for (i = 1;i<=n;i++) {
		if (a[i]==x) {
			cout <<i<< endl;
			break;
		}
	}
	if (i==n+1)
		cout << "Not find" << endl;
}
//二分查找

void BinarySearch(int x) {
	int l=1, r=n, mid,flag=0;
	while (l <= r) {
		mid = (l + r) / 2;
		if (a[mid] < x)
			l = mid + 1;
		else if (a[mid] > x)
			r = mid-1;
		else {
			cout << mid << endl;
			flag = 1;
			break;
		}
	}
	if (!flag)
		cout << "Not find" << endl;
}
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	cin >> cnt;  

	while (cnt--) {
		int x;
		cin >> x;   
		sequenSearch(x);//顺序 
		// BinarySearch(x);//二分 
	}
}