int search(int arr[],int key,int start,int end) {
		if(start<end ) {
		int mid=start+(end-start)/2;
		if(key<arr[mid]) {
			return(search(arr,key,start,mid));
		}
		else if(key>arr[mid]) {
			return(search(arr,key,mid+1,end));
		}
		else if(key==arr[mid]) {
			return key;
		}
		}
		else {
		return -1;
	}
		return 1;
	}