The week's pick
Reseach Article
Implementing and Analyzing an Efficient Version of Counting Sort (E-Counting Sort)
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 98 - Number 9 |
| Year of Publication: 2014 |
| Authors: Keshav Bajpai, Ashish Kots |
10.5120/17208-7427
|
Keshav Bajpai, Ashish Kots . Implementing and Analyzing an Efficient Version of Counting Sort (E-Counting Sort). International Journal of Computer Applications. 98, 9 ( July 2014), 1-2. DOI=10.5120/17208-7427
Abstract
Counting sort is a simple, stable and efficient sorting algorithm with linear running time, which is a fundamental building block for many applications. Counting sort algorithm has been widely used in data processing systems, because of its high efficiency, fast speed and stable nature. Therefore, a thorough study of its time complexity is required. This paper presents a modified version of counting sort E-Counting Sort with some efficiency improvements. An analysis of the E-Counting sort algorithm in comparison with original counting sort algorithm clearly shows that E-Counting sort algorithm having a reduced time complexity approximately to half of the original one. The new version can be applied to many real world applications providing the required result as efficient and as effective as original counting sort without affecting its real nature and improve the efficiency of application program.
References
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms
- www. cse. iitk. ac. in/teaching/courses/CS210. html.
- M R Babu, M Khalid ," Performance Analysis of Counting Sort Algorithm using various Parallel Programming Models" International Journal of Computer Science and Information Technologies, Vol. 2 (5), 2011
Index Terms
Keywords