查找算法的实现顺序和折半

最新推荐文章于 2023-09-23 07:00:00 发布

原创最新推荐文章于 2023-09-23 07:00:00 发布 · 510 阅读

0 ·

CC 4.0 BY-SA版权

数据结构专栏收录该内容

15 篇文章

订阅专栏

本文深入探讨了数组查找算法中的顺序查找与折半查找两种方法，详细解释了每种方法的工作原理、实现过程及应用场景。通过实例代码演示，直观展示查找过程，并比较了两种方法的时间复杂度，帮助读者理解不同场景下选择最优查找策略的重要性。

#include<iostream>
#include<stdio.h>

using namespace std;

//对于数组的顺序查找
//int search(int a[],int key,int count ){
// int x = 0;
//
// for (int i = 0; i < count; ++i){
//
// if (a[i] == key)
// {
// ++x;
// cout << "找到了,第" << i << "个位置" << endl;
// }
// }
// cout << "总共出现了" << x << "次" << endl;
//
// return 0;
//}

//对于数组的折半查找

int Half_search(int a[],int key,int count){
int low = 0, high = count;
int mid;
while (low <= high)
{
mid = (low + high) / 2;
cout << "mid" << mid<<endl;
cout << "a[mid]" << a[mid] << endl;
cout << "key" << key << endl;
if (a[mid] == key)
{
cout << "find" << endl;
cout << "a[mid]=" << a[mid] << "," <<"key"<< key << endl;
cout << "第" << mid << "个" << endl;
return mid;
}
else
if (a[mid] < key)
{
low = mid + 1;
}
else
high = mid - 1;
}
cout << "not find" << endl;
return 1;
}

void main(){
int a[10] = {0,2,4,6,8,10,15,17,19,20};
int count = sizeof(a)/sizeof(int);
cout << "count" << count << endl;
int key;

cout << "请输入要查询的关键字：" << endl;

cin >> key;
Half_search(a, key, count);
system("pause");

}