int search(int a[],int from,int to,int key) { if(to<from) return -1; int middle = (from+to)/2; if(a[middle]==key) return middle; if(a[middle]>key) return search(a,from,middle-1,key); else return search(a,middle+1,to,key); }