顺序查找:适用于所有数组,效率低
二分查找:使用与已序数组,效率高
一、顺序查找
#include <iostream>
using namespace std;
int sequential_search(int *arry, int size, int val)
{
for (int i = 0; i < size - 1; i++)
{
if (arry[i] == val)
return i;
}
return -1;
}
int main()
{
int arry[10] = {1,3,4,5,2,0,8,9,6,7,};
int res = sequential_search(arry,sizeof(arry)/sizeof(arry[0]),6);
if (res < 0)
cout << "没找到" << endl;
else
cout << "pos:" << res << endl;
return 0;
}
二、二分查找
#include <iostream>
using namespace std;
//二分查找
int binary_search(int *arry, int num, int val)
{
int left = 0, right = num - 1;
while (left <= right)
{
i