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.
Yes, it appears the question is to calculate the number of insertion sort swaps with O(n*log(n)) time complexity, but this is not explained well at all and the automated answers do not except this type of answer. This was my first algo, but then after realizing how poorly designed the question is, I moved on.
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 →
Yes, it appears the question is to calculate the number of insertion sort swaps with O(n*log(n)) time complexity, but this is not explained well at all and the automated answers do not except this type of answer. This was my first algo, but then after realizing how poorly designed the question is, I moved on.