算法导论----<二分法改进递归插入算法>及实例

/*
伪代码
BINARY(A,p,r,v)
for j=p to r
if A[j] = v
return k
return NIL

BINARY-SEARCH(A,p,r,v)
if p = 0 and r = 0 and A[0]=v
return 0
if p<r
q = (p+r)/2
if A[q] > v
BINARY-SEARCH(A,p,q,v)
return BINARY(A,p,q,v)
else BINARY-SEARCH(A,q+1,r,v)
return BINARY(A,q+1,r,v)
return NIL
*/


#include <iostream>
#include <stdlib.h>
using namespace std;
int i,j,key;
int binary(int *A,int p,int r,int s)
{
int middle = (p+r)/2;
if(A[middle] == s)
{
return middle;
}
if(A[middle] > s)
{
return binary(A,p,middle,s);
}else{
return binary(A,middle+1,r,s);
}
return false;
}


int main(){

int A[10] = {1,3,5,7,9,11,15,17,19,20};
cout<<binary(A,0,9,15)<<endl;

for( j=0;j<10;j++)
{
cout<<A[j]<<" ";
}
return 0;

}

时间复杂度是O(nlgn)