An Adaptive Sorting Algorithm for Almost Sorted List
DOI:
https://doi.org/10.26438/ijcse/v5i12.169172Keywords:
Adaptive sort, Time complexity, Paper sort, Sorted list, Un-sorted listAbstract
Sorting algorithm has a great impact on computing and also attracts a grand deal of research. Even though many sorting algorithms are evolved, there is always a scope of for a new one. As an example, Bubble sort was first analyzed in 1956, but due to the complexity issues it was not wide spread. Although many consider Bubble sort a solved problem, new sorting algorithms are still being evolved as per the problem scenarios (for example, library sort was first published in 2006 and its detailed experimental analysis was done in 2015) [11]. In this paper new adaptive sorting method Paper sort is introduced. The method is simple for sorting real life objects, where the input list is almost but not completely sorted. But, one may find it complex to implement when time-and-space trade-off is considered.
References
E. Horowitz, S. Sahani, “Fundamentals of Computer Algorithms”, Computer Science Press, Rockville, Md., 1998.
D. Knuth, “The Art of Computer Programming”, volume 3 “Sorting and searching”, Second edition, Assison Wesley, 1998.
C.L. Liu, “Analysis of Sorting Algorithms”, Proceedings of Switching and Automata Theory, 12th Annual Symposium, East Lansing, MI, USA, pp. 207-215, 1971.
M. Devi, S. Charaya, “Enhancing the Efficiency of Radix sot by using clustering Mechanism: A Review”, IJSRD, Volume 4 Issue 5, pp.847- 850, 2016.
J. Darlington, “A synthesis of several sorting algorithms”, Acta Informatica II, Springer-Verlag, pp. 1-30, 1978.
John Darlington, Remarks on “A Synthesis of Several Sorting Algorithms”, Springer Berlin / Heidelberg”, Volume 13, March 1980, pp. 225-227.
A. Andersson, T. Hagerup, S. Nilsson, R. Raman, Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, 1995.
V. Paul, “Entropy, Search, Complexity- Algorithms by Kolmogorov Complexity (A Survey)”, Bolyai Society Springer, pp. 209-232, 2007
R. Harter, “A Computer Environment for Beginners' Learning of Sorting Algorithms: Design and Pilot Evaluation”, ERIC, Journal Number 795978, Computers & Education, volume 51 No.2, pp. 708-723, 2008
A. Bharadwaj, S. Mishra, “Comparison of Sorting Algorithms based on Input Sequences”, International Journal of Computer Applications, Volume 78 No.14, pp.7-10, 2013
N. Faujdar, S. Ghrera, “A Detailed Experimental Analysis of Library sort Algorithm”, INDICON, IEEE, pp. 1-6, 2015
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
