We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
This has no advantage than just a sorted array in my mind.
the tricks to avoid timeout is really when insert element into a sorted array should be try to use binary search, which always try size/2 position then try next position.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Heaps: Find the Running Median
You are viewing a single comment's thread. Return to all comments →
This has no advantage than just a sorted array in my mind.
the tricks to avoid timeout is really when insert element into a sorted array should be try to use binary search, which always try size/2 position then try next position.