Description: Statistical reverse pair, set a [0 ... n-1] is an array that contains the number n, if the i <j的情况下，有a[i]> a [j], called (i, j) is a array of a reverse pair (inversion). Such as < 2,3,8,6,1> has 5 reverse pairs. Consider a worst-case O (nlogn) algorithm to determine the n number of elements on the reverse. Note that this problem Do not use O (n ^ 2) to achieve a simple enumeration. And consider the following questions: (1) how the array contains the most reverse of its? Most is how many do? (2) the running time of insertion sort an array in reverse order and the number on the relationship you have? What is the relationship?
To Search:
File list (Check if you may need any files):
统计逆序对\tongjinixudui\bin\Debug\tongjinixudui.exe
..........\.............\main.c
..........\.............\obj\Debug\main.o
..........\.............\tongjinixudui.cbp
..........\.............\tongjinixudui.depend
..........\.............\tongjinixudui.layout
..........\.............\bin\Debug
..........\.............\obj\Debug
..........\.............\bin
..........\.............\obj
..........\tongjinixudui
统计逆序对
Download