Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

看了这位兄弟的问题,偶比他费解多了...

Posted by mixter at 2005-10-03 01:01:13 on Problem 2623
In Reply To:理论与实践没有很好结合的结果,看来党的保先是很有必要的~~~~ Posted by:xemoaya at 2005-10-03 00:58:12
> 归并排序虽然是o(nlogn),但是因为频繁作数据读写操作(归并的时候把一半的数据
> 写到buffer中去),所以速度是很慢的,远慢于同样是o(nlongn)的堆排序。而qsort
> 只不过是最坏情况是o(n^2),平均起来却是最快的,要不怎么叫快速排序?兄弟一定
> 没学过数据结构吧?

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator