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.
he just said you can count inverstions by incrementing every time a higher index is smaller than a lower index. merge sort is most definitely not the answer
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Running Time of Algorithms
You are viewing a single comment's thread. Return to all comments →
he just said you can count inverstions by incrementing every time a higher index is smaller than a lower index. merge sort is most definitely not the answer