Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
