arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.5111cs.DS
收藏

RS排序器的设计与分析

Design and Analysis of RS Sort

Harsh Ranjan, Sumit Agarwal, Niraj Kumar Singh

摘要:

本文提出了一种新的基于比较的稳定排序算法--RS排序。RS排序只涉及数组中元素对的比较,最终对数组进行排序,而不涉及每个元素与其他元素的比较。RS排序试图建立在每一次传递中元素之间建立的关系之上。假设有一个数组包含三个元素a1,a2,a3,如果存在一个关系,使得a1 <a2和a2 <a3,那么可以确定a1 <a3,因此不需要比较a1和a3。排序是计算机科学中的一个基本操作。对RS排序进行了理论和实证分析。我们进行了实证分析,并比较了其性能与众所周知的快速排序的各种输入类型。

英文摘要:

This paper introduces a new comparison base stable sorting algorithm, named RS sort. RS Sort involves only the comparison of pair of elements in an array which ultimately sorts the array and does not involve the comparison of each element with every other element. RS sort tries to build upon the relationship established between the elements in each pass. Suppose there is an array containing three elements a1, a2, a3 and if a relationship exist such that a1<a2 and a2<a3 then it can be established that a1<a3 and so there is no need to compare a1 and a3. Sorting is a fundamental operation in computer science. RS sort is analyzed both theoretically and empirically. We have performed its Empirical analysis and compared its performance with the well-known quick sort for various input types.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑