003 ; DSA ; Overlap Detection with Sweep Line Algorithm

ABSTRACT

How do we find whether shapes intersect without checking every shape at the same time which leads to $O(n^2)$ time complexity?