A quick Algorithm for Inversion Number of Permutation
Zhou Shang-chao · Journal of East China Jiaotong University · 2007
Let {a1,a2,…,an } be a permutation of the set{ 1,2,...,n}.If ij and aiaj then the pair(ai,aj) is called an of the permutation.In this paper,by mergesort method a quick algorithm for inversion number of permutation was gained.