Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Anqing Teachers College(Natural Science Edition)》 2008-03
Add to Favorite Get Latest Update

Comparing with Several Kinds of Quick Ordering Algorithms Realization

HU Yun(Wuxi Radio & Television University,Wuxi 214011,China)  
Fast sorting is one kind of basic sorting thought and there are many kinds to realize.Compared with several kinds of methods,one discovers that the time complexity to carry out is O(nlog2n),in general.However,it can have some different methods to realize,and it may lead to some differences in the concrete execution time.Finding out these differences,the advantageous way can be chosen to solve some problems.
【CateGory Index】: TP301.6
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved