Recursive implementation of binary search

Table does not have equal elements, correct binary lookup notation # include <stdio.h>int binsearch (int a[],int n,int key) {//First call when parameter check if (n <= 0) return-1;//Pass The Calling parameter checks if (n = = 1 && a[0]! = key) return-1;if (a[n/2]<key) {int index = Binsearch (a+n/2,n-n/2,key); return index = =-1? -1:n/2+index;} else if (A[n/2]>key) {return binsearch (A,n/2,key);} else return N/2;} void Main () {int a[100000];for (int i=0;i<sizeof (a)/sizeof (int); i++) A[i] = I;int index = Binsearch (A,sizeof (a)/sizeof (int), sizeof (a)/sizeof (int)-1);p rintf ("index%d", index);}

Reference Links:

http://blog.csdn.net/drzhouweiming/article/details/1562717

Recursive implementation of binary search