Become a member
Sign in
The Skyline Problem
21
3
Dimka Maleev
Animesh Srivastava
Animesh Srivastava
Sep 2, 2018 · 1 min read

I am not clear about the time complexity analysis. Maintaining the priority_queue has the time complexity of O(nlog n). Then why is the whole algorithm’s time complexity O(n)?

    Animesh Srivastava

    Written by

    Animesh Srivastava

    Write the first response

    Discover Medium

    Welcome to a place where words matter. On Medium, smart voices and original ideas take center stage - with no ads in sight. Watch

    Make Medium yours

    Follow all the topics you care about, and we’ll deliver the best stories for you to your homepage and inbox. Explore

    Become a member

    Get unlimited access to the best stories on Medium — and support writers while you’re at it. Just $5/month. Upgrade
    AboutHelpLegal