A Novel Sorting Method for Real and Integer Numbers: An Extension of Counting Sort
Student, GEHU, Bhimtal Campus, Uttarakhand, India., Kshitij Kala, Sandeep Kumar Budhani, Associate Professor, GEHU, Bhimtal Campus, Uttarakhand, India., Rajendra Singh Bisht, Dhanuli Kokil Bisht, Student, GEHU, Bhimtal Campus, Uttarakhand, India., Kuljinder Singh Bumrah, Assistant Professor, GEHU, Dehradun, India. · International Journal of Engineering and Advanced Technology · 2020
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).