Returns index of key in arr [ l . . h ] if key is present , otherwise returns - 1
function search ( arr , l , h , key ) { if ( l > h ) return - 1 ; let mid = Math . floor ( ( l + h ) / 2 ) ; if ( arr [ mid ] == key ) return mid ;