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.
Apparently it does. I believe this is because merge sort is stable (no unnecessary swaps of equal elements). Why do you think merge sort does not guarantee a minimum number of swaps?
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 →
Apparently it does. I believe this is because merge sort is stable (no unnecessary swaps of equal elements). Why do you think merge sort does not guarantee a minimum number of swaps?