检索结果-内蒙古大学图书馆

Iqselect algorithms for finding the kth value based on incomplete quick sort algorithm

Journal of Convergence Information Technology 2011年第5期6卷 183-191页

作者： Fuguo, Dong Li, Yurong Da, Yuan School of computer science and technology Shandong Institute of Business and Technology YanTai Shandong China

value is introduced, quick sort algorithm is considered thoroughly, and a new IQSelect algorithm based on incomplete quick sort algorithms is proposed to quickly search the kth value of any randomly given sequence. In the new IQSelect algorithm, only parts of the items in sequence need to be sorted. More important, the number of items to be sorted is reduced greatly after every quicksort step by step. Then many data comparison and item swap operations are reduced, and the efficiency of finding the kth value is improved greatly. algorithm analysis shows that the time complexity of the new algorithm is 2n, much better than that of the existing algorithm, whose core module has time complexity 6.09n. At last, lots of experiments are done to compare the performance of IQSelect algorithm based on incomplete quick sort algorithm and the existing popular algorithm for finding the kth value of randomly given sequence. All Experiment results give the same conclusion as the algorithm analysis. The IQSelect algorithm gives a new idea for the kth value searching and the study of sort algorithm, and is of great significance.

关键词： incomplete sort algorithm Kth value Quick sort algorithm

来源：评论

学校读者我要写书评

暂无评论

Several incomplete sort algorithms for getting the median value

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content Technology and its Applications 2010年第8期4卷 193-198页

作者： Fuguo, Dong School of computer science and technology Shandong Institute of Business and Technology Shandong YanTai China

To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm and bubble sort algorithm are redesigned as incomplete sort algorithms to quickly give the median value of randomly given sequence. In the new algorithms, only parts of the items in sequence need to be sorted to give the median value, then many data comparison and movement operation are reduced, and the speed of getting median value can be improved greatly. Besides, insertion sort algorithm and merge sort algorithm are analyzed thoroughly and found not suitable to be redesigned as incomplete sort algorithms for this purpose. At last, lots of experiments are done to compare the performance of incomplete selection sort algorithm and incomplete bubble sort algorithm. Experiment results and algorithm analysis show that incomplete selection sort algorithm perform very well in case of both short sequence and long sequence.

关键词： Bubble sort algorithm incomplete sort algorithm Median value Selection sort algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：