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.
1) Check Tim Roughgarden's lecture: he has a really good explanation about incrementing the total count.
2) Swapping the original and the aux array saves you an extra "copying" step each time you make a merge: take a small example and run the algorithm manually to see how it works.
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 →
Hey there!
1) Check Tim Roughgarden's lecture: he has a really good explanation about incrementing the total count.
2) Swapping the original and the aux array saves you an extra "copying" step each time you make a merge: take a small example and run the algorithm manually to see how it works.