首页 | 本学科首页   官方微博 | 高级检索  
     

常用内排序算法的分析与比较
引用本文:周慧琴.常用内排序算法的分析与比较[J].电脑开发与应用,2009,22(6):67-69.
作者姓名:周慧琴
作者单位:忻州师范学院专科部,山西,忻州,034000
摘    要:排序是计算机程序设计中的一种重要操作,在数据处理中占有极重要的位置,其方法也很多,有快速排序、冒泡法排序、选择法排序等。排序算法的好坏,直接影响到实现的复杂度。介绍了常用的排序算法,并详细讨论了各种排序法的实现。最后对这些排序算法进行了比较,得出具有一定指导意义的结论。

关 键 词:排序  时间复杂度  算法描述  记录

Analysis and Comparison of Commonly Used Sequencing Algorithms
Zhou Huiqin.Analysis and Comparison of Commonly Used Sequencing Algorithms[J].Computer Development & Applications,2009,22(6):67-69.
Authors:Zhou Huiqin
Abstract:sequencing is very important in programming.Sequencing is very important when dealing with data,and there are many methods.This article analyzes bubble sequencing,selection sequencing,quick sequencing and so on.The sequencing algorithm has great influence on the complexness of your program.This article introduces you various sequencing algorithms and do some researches.At the end,a comparation among them is given,then come to the guiding proposal.
Keywords:
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号