1.问题描述:
二分查找算法
2.分析
- 二分查找的时间复杂度是O(log(n)),最坏情况下的时间复杂度是O(n)。
- 二分查找的一个条件是待查询的数组是有序的,我们假设这里的数组是升序的。
- 二分查找的主要思路就是设定两个指针start和end分别指向数组元素的首尾两端,然后比较数组中间结点arry[mid]和待查找元素。如果待查找元素小于中间元素,那么表明带查找元素在数组的前半段,那么将end=mid-1,如果待查找元素大于中间元素,那么表明该元素在数组的后半段,将start=mid+1;如果中间元素等于待查找元素,那么返回mid的值。
3.源码
#include <stdexcept>
#include <iostream>
using std::cout;
using std::endl;
//递归方法
int findIndexRec(int numbers[], int start,int end, int findNumber, int ×)
{
if(numbers == nullptr||start > end)
throw std::logic_error("Invalid Parameters!");
int startIndex = start;
int endIndex = end;
int mindIndex = startIndex;
if(startIndex <= endIndex)
{
++times;
mindIndex = startIndex + (endIndex - startIndex)/2;
if(findNumber > numbers[mindIndex] )
{
startIndex = mindIndex +1;
return findIndexRec(numbers,startIndex,endIndex,findNumber,times);
}
else if(findNumber < numbers[mindIndex])
{
endIndex = mindIndex -1;
return findIndexRec(numbers,startIndex,endIndex,findNumber,times);
}
}
if(startIndex > endIndex)
throw std::logic_error("not in numbers!");
return mindIndex;
}
//非递归方法
int findIndex(int numbers[],int length,int findNumber,int ×)
{
if(numbers == nullptr||length <=0)
throw std::logic_error("Invalid Parameters!");
int startIndex = 0;
int endIndex = length -1;
int mindIndex = startIndex;
while(startIndex <= endIndex)
{
++times;
mindIndex = startIndex + (endIndex -startIndex)/2;
if(numbers[mindIndex] == findNumber)
{
break;
}
else if(findNumber >numbers[mindIndex])
startIndex = mindIndex+1;
else
endIndex = mindIndex -1;
}
if(startIndex > endIndex)
throw std::logic_error("not in numbers!");
return mindIndex;
}
int main()
{
int times = 0;
const int length = 99;
int numbers[length]= {0};
for(int i=0;i<length;++i)
numbers[i]=i;
int findNumber = 10;
try
{
int index = findIndexRec(numbers,0,length-1,findNumber,times);
cout << "index:"<<index <<" result:"<< numbers[index]<<" times:"<<times<<endl;
}
catch(std::logic_error ex)
{
cout << ex.what()<<endl;
}
times = 0;
try
{
int index = findIndex(numbers,length,findNumber,times);
cout << "index:"<<index <<" result:"<< numbers[index]<<" times:"<<times<<endl;
}
catch(std::logic_error ex)
{
cout << ex.what()<<endl;
}
return 0;
}
运行结果图: