基础算法
1、二分法
在包含size个元素的,从小到大排序的int数组a里查找元素p,如果找到,返回元素下标,如果找不到,返回-1.
#include<iostream>
using namespace std;
int BinarySearch(int a[], int size, int p)
{
int L = 0;
int R = size - 1;
while (L <= R)
{
int mid = L + (R - L) / 2;
if (p == a[mid])
return mid;
else if (p > a[mid])
L = mid + 1;
else if (p < a[mid])
R = mid - 1;
}
return -1;
}
int main()
{
cout << "请输入需要查找的元素p" << endl;
int p;
cin >> p ;
cout << "请输入size" << endl;
int size;
cin >> size;
int a[100];
cout << "请输入a" << endl;
for (int i = 0; i < size; i++)
{
cin >> a[i];
}
cout<<BinarySearch(a, size,p)<<endl;
return 0;
}