QUESTION
We can determine how "out of order" an array A is by counting the number of inversions it has.
Two elements A[i] and A[j] form an invers...
For further actions, you may consider blocking this person and/or reporting abuse
Hi @theghostyced . so I decided to try and solve this on my own and I want to share my insights
my first solution was to
write some logicgoogle the question and I came across a solution that didn't satisfy the complexityI then tried to rewrite this using list comprehension, you can see my effort here
but this also revealed the answers which you can use to solve this question.
Thanks @areahints but I think the time complexity still remains the same irrespective of the list comprehension.
yes, I mentioned that my list comprehension didn't satisfy the complexity.
consider this solution;
Output
that's an O(n log n) implementation that I mentioned has been revealed in the link. did you read through it?