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.
The key to avoiding timeouts with Python is to make sure that your merge function doesn't use del or list.pop(0) which is O(n). Instead iterate through the arrays with indices (or alternatively merge the arrays from back to front).
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Merge Sort: Counting Inversions
You are viewing a single comment's thread. Return to all comments →
The key to avoiding timeouts with Python is to make sure that your merge function doesn't use del or list.pop(0) which is O(n). Instead iterate through the arrays with indices (or alternatively merge the arrays from back to front).