text: If arr [ l . . mid ] is not sorted , then arr [ mid ... r ] must be sorted
code: if key >= arr [ mid ] and key <= arr [ h ] : NEW_LINE INDENT return search ( a , mid + 1 , h , key ) NEW_LINE DEDENT return search ( arr , l , mid - 1 , key ) NEW_LINE