二分查找

今天看CSDN上说,90%的程序员不能正确写出二分查找法或者说,写出的代码在编译运行前都有BUG

于是我试了试

#include <iostream> using namespace std; bool bbsearch(int *A,const int n,const int begin,const int end) { int flag = 0; if( (begin+end)%2 == 0) { flag = (begin + end) / 2; } else { flag = (begin + end + 1) / 2; } if( A[flag] == n ) { cout << "Got it!" << A[flag] << endl; return true; } else if( A[flag] < n ) { bbsearch(A,n,flag,end); } else if( A[flag] > n ) { bbsearch(A,n,begin,flag); } } int main() { int *A = new int(10); for(int i = 0;i < 10; ++i) { A[i] = i; cout << A[i] << " "; } cout << endl; int n = 0; cin >> n; bool result = bbsearch(A,n,0,9); cout << boolalpha << result; return 0; }

 

一次成功=.=

我是那10%不成?

 

不过我用的是递归算法...似乎,好像,怎么用迭代实现呢?

递归:深度优先,深度不可预见

迭代:深度可预见

 

这里的深度...应该是可预见的,必然可以用迭代来实现

下面是我写的迭代法的算法...

bool bbbsearch(int *A,const int n,int begin,int end) { int mid = 0; if( (begin + end) % 2 == 0 ) { mid = (begin + end )/2; } else { mid = (begin + end + 1)/2; } while( mid != 0 ) { if(A[mid] == n) { cout << "Got it!" << A[mid] << endl; return true; } else if(A[mid] < n) { begin = mid + 1; if( (begin + end) % 2 == 0) { mid = (begin + end) / 2; } else { mid = (begin + end + 1) / 2; } } else if(A[mid] > n) { end = mid - 1; if( (begin + end) % 2 == 0) { mid = (begin + end) / 2; } else { mid = (begin + end + 1) / 2; } } } }