Abstract
There are various sorting methods in the literature, which are sequential in nature and have linear time complexity. But these methods are not preferred to use due to large memory requirements in specific cases. Counting sort is one, which lies in this domain. In this chapter, we have suggested an improvement on the counting sort. Due to this improvement, the memory requirement for counting sort is reduced up to a significant level. We have tested this modified counting sort on numerous data sets and the results obtained by these experiments are very much satisfactory. Results shows that this memory requirement is reduced at least 50% than traditional counting sort. So it opens up the opportunity of using this modified version in many sorting applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Flores, I. (1960). Analysis of internal computer sorting. ACM, 7(4), 389–409.
Franceschini, G., & Geffert, V. (2003). An in-place sorting with O(n log n) comparisons and O(n) moves. In Proceedings of 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 242–250.
Knuth, D. (1998). The Art of Computer programming Sorting and Searching, 2nd edn. Addison-Wesley.
Oyelami Olufemi Moses. (2009). Improving the performance of bubble sort using a modified diminishing increment sorting. Scientific Research and Essay, 4(8), 740–744.
Rupesh, S., Tarun, T., & Sweetes, S. (2009). Bidirectional expansion—insertion algorithm for sorting. In Second International Conference on Emerging Trends in Engineering and Technology, ICETET-09.
Radu, R., & Martin, R. Automatic Parallelization of Divide and Conquer Algorithm” Laboratory of Computer Science. Cambridge, MA, USA: Massachusetts Institute of Technology.
Dean, C. (2006). A simple expected running time analysis for randomized divide and conquer algorithms. Computer Journal of Discrete Applied Mathematics, 154(1), 15.
Friend, E. (1956). Sorting on electronic computer systems. Computer Journal of ACM, 3(3), 134168.
Rajasekhara Babu, M., Khalid, M., Sachin, S., Sunil, C., Babu, M. (2011). (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 2 (5) 2284–2287.
Andersson, A., & Nilsson, S. (1994). A new efficient radix sort. In Proceedings of 35th Annual IEEE Symp. on Foundations of Computer Science, pp. 714–721.
Meinel, C., & Sack, H. (2013). Internetworking. Berlin Heidelberg: X.media.publishing, Springer-Verlag. https://doi.org/10.1007/978-3-642-35392-5_2.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Kumar, R. (2019). Modified Counting Sort. In: Kapur, P., Klochkov, Y., Verma, A., Singh, G. (eds) System Performance and Management Analytics. Asset Analytics. Springer, Singapore. https://doi.org/10.1007/978-981-10-7323-6_21
Download citation
DOI: https://doi.org/10.1007/978-981-10-7323-6_21
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-7322-9
Online ISBN: 978-981-10-7323-6
eBook Packages: Business and ManagementBusiness and Management (R0)