public static void main(String args[]) {
        int input[] = {9, 6, 4, 5, 8};
        CountInversionOfSize3 ci = new CountInversionOfSize3();
        System.out.print(ci.findInversions(input));
    }
Time complexity of this method is O(n^2)
Space complexity is O(1)
src/com/interview/array/CountInversionOfSize3.java