You are viewing a single comment's thread. Return to all comments →
Ok, I think I got it: This problem is not about the number of inversions. It is about the minimum number of swaps.
You can try heapsort as it works beautifully in this case.
Lily's Homework
You are viewing a single comment's thread. Return to all comments →
Ok, I think I got it: This problem is not about the number of inversions. It is about the minimum number of swaps.
You can try heapsort as it works beautifully in this case.