0
Please help me make this code less ugly. Given a list of numeric intervals in the form of (a,b), where a and b are integers, it finds a set of disjoint intervals that cover the same numbers by splitting the original intervals at the points where they intersect. For example: disjoint [(1,2),(1,3),...