SieveSort:: Yet another sorting algorithm

被引：0

作者：

Pal, RK ^{[1
]}

机构：

[1] Univ Calcutta, Dept Comp Sci & Engn, Kolkata 700009, W Bengal, India

来源：

TENCON 2004 - 2004 IEEE REGION 10 CONFERENCE, VOLS A-D, PROCEEDINGS: ANALOG AND DIGITAL TECHNIQUES IN ELECTRICAL ENGINEERING | 2004年

关键词：

sorting; comparison sort; divide-and-conquer; record; satellite data; algorithm; complexity;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Sorting is a well-known computational problem. Sorting means arranging a set of records (or a list of keys) in some (increasing or decreasing) order, In this paper, we propose a new comparison sorting algorithm SieveSort, based on the technique of divide-and-conquer, that takes time O(n(2)) in the worst-case, where n is the number of records in the given list to be sorted. This sorting algorithm could be treated as a multi-way Quicksort, which can be used to identify a desired key without sorting the entire sequence.

引用

页码：B357 / B360

页数：4