Location of Repository

Modification in Sieve Sort

By Varun Jain and Dr. Suneeta Agarwal


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. A new sorting algorithm named as Sieve Sort[1] has been claimed to be stable by the author. We have contradicted its stability through examples. Stable sorting algorithms maintain the relative order of records with equal keys. We have modified the Sieve Sort[1] to make it a stable sorting algorithm. We have also proposed some modifications in the said algorithm to make it faster

Year: 2011
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.utexas.edu/%7Eva... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.