| 几种快速排序算法实现的比较 |
| |
| 引用本文： | 胡云.几种快速排序算法实现的比较[J].安庆师范学院学报(自然科学版),2008,14(3). |
| |
| 作者姓名： | 胡云 |
| |
| 作者单位： | 无锡市广播电视大学,江苏,无锡,214011 |
| |
| 摘 要： | 快速排序是一种基本的排序思想,但实现方法有多种。通过对几种实现方法的比较,发现在一般情况下,它们执行的时间复杂度都为O(nlog2n),但它们的实现方法有一些不同,这也决定了它们在具体的执行时间上存在一些差别。了解这些差异,有利于在解决问题时选择最佳的方法。
|
| 关 键 词： | 快速排序 算法实现 时间复杂度 |
Comparing with Several Kinds of Quick Ordering Algorithms Realization |
| |
| HU Yun.Comparing with Several Kinds of Quick Ordering Algorithms Realization[J].Journal of Anqing Teachers College(Natural Science Edition),2008,14(3). |
| |
| Authors: | HU Yun |
| |
| Institution: | HU Yun(Wuxi Radio & Television University,Wuxi 214011,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | quick sort algorithm realization the order of time complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
