A Novel Sorting Method for Real and Integer Numbers: An Extension of Counting Sort
Kshitij Kala1, Sandeep Kumar Budhani2, Rajendra Singh Bisht3, Dhanuli Kokil Bisht4, Kuljinder Singh Bumrah5
1Kshitij Kala, Student, GEHU, Bhimtal Campus, (Uttarakhand), India.
2Sandeep Kumar Budhani, Associate Professor, GEHU, Bhimtal Campus, (Uttarakhand), India.
3Rajendra Singh Bisht, Research Scholar, GEU, Dehradun (Uttarakhand), India.
4Dhanuli Kokil Bisht, Student, GEHU, Bhimtal Campus, (Uttarakhand), India.
5Kuljinder Singh Bumrah, Assistant Professor, GEHU, Dehradun (Uttarakhand), India.
Manuscript received on 27 April 2019 | Revised Manuscript received on 09 May 2019 | Manuscript Published on 18 May 2019 | PP: 36-39 | Volume-8 Issue-6S4 November 2019 | Retrieval Number: F10031186S419/19©BEIESP | DOI: 10.35940/ijeat.F1003.1186S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Sorting is an essential conceptin the study of data structures. There are many sorting algorithms that can sort elements in a given array or list. Counting sort is a sorting algorithm that has the best time complexity. However, the counting sort algorithm only works for positive integers. In this paper, an extension of the counting sort algorithm is proposed that can sort real numbers and integers (both positive and negative).
Keywords: Counting Sort, Sorting, Algorithm.
Scope of the Article: Multimedia and Real-Time Communication