| 高重复率数据的快速排序 |
| |
| 引用本文： | 陈宝平. 高重复率数据的快速排序[J]. 电子科技, 2011, 24(8): 22-23,30 |
| |
| 作者姓名： | 陈宝平 |
| |
| 作者单位： | (内蒙古财经学院 信息管理系,内蒙古 呼和浩特 010050) |
| |
| 基金项目： | 内蒙古自然科学基金资助项目(2010MS1007) |
| |
| 摘 要： | 对于重复率较高的任意类型大量数据的排序,文中提出了一种新算法。该算法具有快速排序算法的简洁性,又避开了递归算法,时间复杂度为O（n）,空间复杂度为O（1）。理论分析和实验表明,该算法的性能明显优于其它排序算法,适合于数据量较大的场合。
|
| 关 键 词： | 高重复率数据 快速排序算法 排序效率 |
Quick Sorting Algorithms of High Repetition Rate Data |
| |
| CHEN Baoping. Quick Sorting Algorithms of High Repetition Rate Data[J]. Electronic Science and Technology, 2011, 24(8): 22-23,30 |
| |
| Authors: | CHEN Baoping |
| |
| Affiliation: | (Department of Computer Information and Management,Inner Mongolia Finance and Economics College,Hohhot 010050,China) |
| |
| Abstract: | In this paper,a new sorting algorithm of high repetition rate any type data is proposed.This algorithm with conciseness of the quick sorting method avoids recursive algorithm.It has the time complexity O(n) and space complexity O(1) only.Both theoretical analysis and experimental tests confirm that the performance of the new sorting algorithm is distinctly better than that of the others and is particularly suitable to the sorting of a great quantity of high repetition rate data. |
| |
| Keywords: | high repetition rate data fast sorting algorithm sorting efficiency |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子科技》浏览原始摘要信息 |
|
点击此处可从《电子科技》下载全文 |
