I want to know if there is an algorithm that: given an unsorted array, I want to go element by element and know the number of subsequent elements that are smaller than the current one.
If that algorithm doesn't exist, could someone give me one efficient, please?
Thanks in advance.
