#include <iostream>
#include <time.h>
#include <algorithm>
using namespace std;
int array[] = {-1, 2, 5, 7, 9, 10, 20, 40, 50, 60};//初始化有序序列
int Recursion(int *list, int left, int right, int value)//二分法的递归实现
{
if(left > right)//递归的终止条件,当left > right
return -1;
int min_pos = (left + right) / 2; // 获取中间的位置
cout << " " << min_pos + 1;
if(list[min_pos] == value)//如果已经找到则返回下标
{
return min_pos;
} else if(list[min_pos] > value)//当中间的值大于value, 搜索左边的序列
{
return Recursion(list, left, min_pos - 1, value);
} else //当中间的值小于value, 搜索右边的序列
{
return Recursion(list, min_pos + 1, right, value);
}
}
int Non_Recursion(int *list, int left, int right, int value)//非递归实现二分法
{
while(left <= right)
{
int min_pos = (left + right) / 2;//获取中间的位置
cout << " " << min_pos + 1;
if(list[min_pos] > value)//当中间的值大于value, 向左收缩查找范围
{
right = min_pos - 1;
} else if(list[min_pos] < value)//当中间的值小value, 向右收缩查找范围
{
left = min_pos + 1;
} else
return min_pos;//相等时返回下表
}
return -1;//为找到返回-1;
}
int main()
{
int length = sizeof(array) / sizeof(int);//数组长度
cout << "数组的内容: ";
for(int i = 0; i < length; i++)
cout << " " << array[i];
while(1)
{
cout << endl << "请输入要查找的元素(0 为未找到):" << endl;
int x, pos;
cin >> x;
clock_t start, finish;
start = clock();
cout << "查找的顺序:";
pos = Recursion(array, 0, length - 1, x) + 1;
cout << endl;
cout << "递归查找的位置: " << pos << endl;
finish = clock();
cout <<"the time cost is: " << 1000* double(finish - start) / CLOCKS_PER_SEC<< " ms" <<endl;//递归用的时间
cout << endl;
start = clock();
cout << "查找的顺序:";
pos = Non_Recursion(array, 0, length - 1, x) + 1;
cout << endl;
cout << "非递归查找的位置: " << pos << endl;//非递归用的时间
finish = clock();
cout <<"the time cost is: " << 1000* double(finish - start) / CLOCKS_PER_SEC<< " ms"<<endl;
}
}
二分搜索算法的实现
最新推荐文章于 2023-03-07 13:45:09 发布