Hi,
Inversions are defined as when i<j then a[i]>a[j]

Hi,

Inversions are defined as when i<j then a[i]>a[j]

ardent dispose is a={2,3,8,6,1}

hence permutations are

2,1 3,1 8,6 8,1 6,1 b. the most permutations take-place when the dispose is in descending direct, i.e { n,n-1...1} now, the permutations obtain be any span elements choice from it which is n(n-1)/2 c.Augmentation genus basically reduces the permutations by 1 in each interation, hence estimate of permutations is straightway proportional to the era of augmentation genus, so hence era of permutation genus is ardent by O(n+f(n)) where f(n) is estimate of permutations, hence if estimate of permutations are n then augmentation genuss tend in O(n) notwithstanding if its n^2, then it tends in O(n^2) here we demand to recognize coercion full n where

8n^{2} < 64nlogn

=n < 8logn

=n/8 < logn

i.e n-8logn>0

on solving the level we obtain, n=43

hence coercion n<=43, augmentation genus is better