I am reading about skyline algorithm that computes the skyline in time O(nlogn) using heap. I am reading it from the following site:
http://www.zrzahid.com/the-skyline-problem/
I can see there are total 2n events, one event each for n left ends of the buildings and one event each for n right ends of the building like this website says:
http://www.algorithmist.com/index.php/UVa_105
But how do we get log n? I don't have a computer science background therefore, would really like someone to break it down for me.
