--->在一个有序数组中查找某个具体的数字
一.常规方法
//在一个有序数组中查找某个具体的数字
//常规方法:
#include <iostream>
using namespace std;
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 7;
int i = 0;
int sz = 0;
sz = sizeof(arr) / sizeof(arr[0]);
for (i = 0; i < sz; i++)
{
if (arr[i] == k)
{
cout << "找到了,下标是:" << i << endl;
break;
}
}
if (i == sz)
{
cout << "找不到" << endl;
}
return 0;
}
二.优化:二分查找(提高效率)
//优化:二分查找(减少循环的次数,优化代码)
#include <iostream>
using namespace std;
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 7;
int sz = 0;
sz = sizeof(arr) / sizeof(arr[0]);
int left = 0;
int right = sz - 1;
while (left <= right)
{
int mid = 0;
mid = left + (right - left) / 2;
if (arr[mid] < k)
{
left = mid + 1;
}
else if (arr[mid] > k)
{
right = mid - 1;
}
else
{
cout << "找到了,下标是:" << mid << endl;
break;
}
if (left > right)
{
cout << "找不到" << endl;
}
}
return 0;
}