Analysis of Algorithm and java

Please Please with divide and conquer

Accept a positive integer n from keyboard and then create an array or arraylist containing elements 1 to n (their orders should be random). Print out the array or arraylist, and then find out and print out the number of inversions in the array or arraylist using divide and conquer.