CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Implementing and Analyzing an Efficient Version of Counting Sort (E-Counting Sort)

by Keshav Bajpai, Ashish Kots
journal cover thumbnail

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

@article{ 10.5120/17208-7427,
author = { Keshav Bajpai, Ashish Kots },
title = { Implementing and Analyzing an Efficient Version of Counting Sort (E-Counting Sort) },
journal = { International Journal of Computer Applications },
issue_date = { July 2014 },
volume = { 98 },
number = { 9 },
month = { July },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-2 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume98/number9/17208-7427/ },
doi = { 10.5120/17208-7427 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:25:43.751264+05:30
%A Keshav Bajpai
%A Ashish Kots
%T Implementing and Analyzing an Efficient Version of Counting Sort (E-Counting Sort)
%J International Journal of Computer Applications
%@ 0975-8887
%V 98
%N 9
%P 1-2
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
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
  1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms
  2. www. cse. iitk. ac. in/teaching/courses/CS210. html.
  3. 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

Computer Science
Information Sciences

Keywords

Counting Sort Algorithm Efficiency Running Time.

Powered by PhDFocusTM