In the sorted array , if start time of an interval is less than end of previous interval , then there is an overlap
for ( int i = 1 ; i < n ; i ++ ) if ( arr [ i - 1 ] . end > arr [ i ] . start ) return true ;