Java-Algorithms- O(n log n)

Create a static method, taking a 1D integer array as its parameter and returns an integer.

Write a method that finds how many times a smaller number comes after a larger number. The method returns the number of times this occurs for a given array. For example, [4,5,6,7,1] returns 4 (there are 4 places before the 1 that makes it out of order) or another example [4,2,5,6,7,1] returns 6(there is one place before 2 + five places before 1 = 6).