If arr [ l . . mid ] first subarray is not sorted , then arr [ mid ... h ] must be sorted subarray
if ( key >= arr [ mid ] && key <= arr [ h ] ) return search ( arr , mid + 1 , h , key ) ; return search ( arr , l , mid - 1 , key ) ; }