Open Access   Article Go Back

An Adaptive Sorting Algorithm for Almost Sorted List

Rina Damdoo1 , Kanak Kalyani2

  1. Department of CSE, RCOEM, Nagpur, India.
  2. Department of CSE, RCOEM, Nagpur, India.

Correspondence should be addressed to: damdoor@rknec.edu.

Section:Review Paper, Product Type: Journal Paper
Volume-5 , Issue-12 , Page no. 169-172, Dec-2017

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v5i12.169172

Online published on Dec 31, 2017

Copyright © Rina Damdoo, Kanak Kalyani . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

IEEE Style Citation: Rina Damdoo, Kanak Kalyani, “An Adaptive Sorting Algorithm for Almost Sorted List,” International Journal of Computer Sciences and Engineering, Vol.5, Issue.12, pp.169-172, 2017.

MLA Style Citation: Rina Damdoo, Kanak Kalyani "An Adaptive Sorting Algorithm for Almost Sorted List." International Journal of Computer Sciences and Engineering 5.12 (2017): 169-172.

APA Style Citation: Rina Damdoo, Kanak Kalyani, (2017). An Adaptive Sorting Algorithm for Almost Sorted List. International Journal of Computer Sciences and Engineering, 5(12), 169-172.

BibTex Style Citation:
@article{Damdoo_2017,
author = {Rina Damdoo, Kanak Kalyani},
title = {An Adaptive Sorting Algorithm for Almost Sorted List},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {12 2017},
volume = {5},
Issue = {12},
month = {12},
year = {2017},
issn = {2347-2693},
pages = {169-172},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1598},
doi = {https://doi.org/10.26438/ijcse/v5i12.169172}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v5i12.169172}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1598
TI - An Adaptive Sorting Algorithm for Almost Sorted List
T2 - International Journal of Computer Sciences and Engineering
AU - Rina Damdoo, Kanak Kalyani
PY - 2017
DA - 2017/12/31
PB - IJCSE, Indore, INDIA
SP - 169-172
IS - 12
VL - 5
SN - 2347-2693
ER -

VIEWS PDF XML
928 535 downloads 389 downloads
  
  
           

Abstract

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.

Key-Words / Index Term

Adaptive sort, Time complexity, Paper sort, Sorted list, Un-sorted list

References

[1] E. Horowitz, S. Sahani, “Fundamentals of Computer Algorithms”, Computer Science Press, Rockville, Md., 1998.
[2] D. Knuth, “The Art of Computer Programming”, volume 3 “Sorting and searching”, Second edition, Assison Wesley, 1998.
[3] C.L. Liu, “Analysis of Sorting Algorithms”, Proceedings of Switching and Automata Theory, 12th Annual Symposium, East Lansing, MI, USA, pp. 207-215, 1971.
[4] 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.
[5] J. Darlington, “A synthesis of several sorting algorithms”, Acta Informatica II, Springer-Verlag, pp. 1-30, 1978.
[6] John Darlington, Remarks on “A Synthesis of Several Sorting Algorithms”, Springer Berlin / Heidelberg”, Volume 13, March 1980, pp. 225-227.
[7] A. Andersson, T. Hagerup, S. Nilsson, R. Raman, Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, 1995.
[8] V. Paul, “Entropy, Search, Complexity- Algorithms by Kolmogorov Complexity (A Survey)”, Bolyai Society Springer, pp. 209-232, 2007
[9] 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
[10] 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
[11] N. Faujdar, S. Ghrera, “A Detailed Experimental Analysis of Library sort Algorithm”, INDICON, IEEE, pp. 1-6, 2015