Proceedings of the Conference on Advances in Communication and Control Systems (CAC2S 2013)

<Previous Article In Volume
Next Article In Volume>

Implementation of the technique of Space minimization for Counting Sort algorithm

Authors
Sanjeev Kumar Sharma, Prem Sagar Sharma
Corresponding Author
Sanjeev Kumar Sharma
Available Online April 2013.
Abstract

Today we consider the question of whether it is possible to sort without the use of comparisons. They answer is yes, but only under very restrictive circumstances. Many applications involve sorting small integers (e.g. sorting the employees according employee Id, sorting the list of students according roll numbers of the student etc.). We present an algorithm based on the idea of speeding up sorting in special cases, by not making comparisons.

Copyright
© 2013, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the Conference on Advances in Communication and Control Systems (CAC2S 2013)
Series
Advances in Intelligent Systems Research
Publication Date
April 2013
ISBN
null
ISSN
1951-6851
Copyright
© 2013, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

risenwbib
TY  - CONF
AU  - Sanjeev Kumar Sharma
AU  - Prem Sagar Sharma
PY  - 2013/04
DA  - 2013/04
TI  - Implementation of the technique of Space minimization for Counting Sort algorithm
BT  - Proceedings of the Conference on Advances in Communication and Control Systems (CAC2S 2013)
PB  - Atlantis Press
SP  - 646
EP  - 649
SN  - 1951-6851
UR  - https://www.atlantis-press.com/article/6382
ID  - Sharma2013/04
ER  -