Given a sorting algorithm that sorts by exchanging keys, and has the
property that, when sorting numbers A[0],A[1],…,A[n-1], it cannot
exchange A[i] and A[j] unless j <=2. It can be shown that each exchange
will decrease the number of inversions by at most 3. What is the best
lower bound on the number of exchange in the worst case, to sort n
elements?
A.n(n-1) B.n(n-1)/3 C.n(n-1)/6 D.n^2/3 E.n^3/4
有請高手解答一下....
不知道怎麼下手...
鋼溫!!
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 223.140.237.117