If middle element is not peak and its left neighbour is greater than it , then left half must have a peak element
else if ( mid > 0 && arr [ mid - 1 ] > arr [ mid ] ) return findPeakUtil ( arr , low , ( mid - 1 ) , n ) ;