Test 1 -  35%  (groups of 3 or 4 students, the applet must posted with code in the web page of one of the students before Nov 8, 2006 10:00pm, send an email reporting the posting with the list of the students in the group)

Let A[1 .. n] be an array of n distinct numbers. If i < j and A[i] > A[j], then the pair (i, j) is called an inversion of A. Build an applet that displays the probability distribution of the number of inversions of uniform random arrays of n distinct numbers. The applet should also calculate (for small n's, n <= 12)and estimate (for big n's, n > 12) the average and variance of the number of inversions.

<Descarga>