对半搜索
摘要:
#include <iostream>using namespace std;int a[5]={1,2,3,4,5};int Bsearch(int x, int left,int right ){ if(left<=right) { int m=(left+right)/2; if(x<a[m]) return Bsearch(x,left,m-1); else if (x>a[m]) return Bsearch(x,m+1,right); else return m; } else return -1;}int main(){ int m=Bsearch( 阅读全文
posted @ 2012-06-20 18:13 矮人狙击手! 阅读(210) 评论(0) 推荐(0) 编辑