二分法查找,这个算法要求数据要是有序的。
比如有这样的问题:找出一个数组中,两个数的和小于等于15,然后输出他们,否则就单独输出较大的数。
BinarySearch.cpp
#include <iostream>
using namespace std;
void binarySearch(int *array, int length){
if(array == NULL || length == 0)
return;
//从小到大排序,双循环,减少比较的次数
for(int i=1; i<length; i++){
for(int j=length -1; j>=i; j--){
if(array[j] < array[j-1]){
int temp = array[j];
array[j] = array[j-1];
array[j-1] = temp;
}
}
}
int index =0;
cout << "sorted array:";
while(index < length){
cout << array[index++] <<", ";
}
cout << endl;
int low = 0;
int high = length -1;
//使用二分法,计算最大和最小数的和是否<=15
while(low < high){
if(array[low] + array[high] <= 15){
cout << "sum 15," << array[low] << "-" << array[high] << endl;
low++;
high--;
}else{
cout << "higher num :" << array[high] << endl;
high--;
}
}
}
int main(){
int array[] = {13,7,3,12,9,14,8,11,6,2,10,1,5};
binarySearch(array,sizeof(array) / sizeof(int));
return 0;
}
测试结果:
PC:~/algorithm$ g++ BinarySearch.cpp -o BinarySearch
PC:~/algorithm$ ./BinarySearch
sorted array:1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
sum 15,1-14
sum 15,2-13
sum 15,3-12
higher num :11
sum 15,5-10
sum 15,6-9
sum 15,7-8