Google scholar arxiv informatics ads IJAIS publications are indexed with Google Scholar, NASA ADS, Informatics et. al.

Call for Paper

-

August Edition 2021

International Journal of Applied Information Systems solicits high quality original research papers for the August 2021 Edition of the journal. The last date of research paper submission is July 15, 2021.

Use-Me Sort: A New Sorting Algorithm

Mohit Sehgal, Nihal Kumar Published in Information Sciences

International Journal of Applied Information Systems
Year of Publication: 2014
© 2013 by IJAIS Journal
10.5120/ijais14-451228
Download full text
  1. Mohit Sehgal and Nihal Kumar. Article: Use-Me Sort: A New Sorting Algorithm. International Journal of Applied Information Systems 7(8):19-22, September 2014. BibTeX

    @article{key:article,
    	author = "Mohit Sehgal and Nihal Kumar",
    	title = "Article: Use-Me Sort: A New Sorting Algorithm",
    	journal = "International Journal of Applied Information Systems",
    	year = 2014,
    	volume = 7,
    	number = 8,
    	pages = "19-22",
    	month = "September",
    	note = "Published by Foundation of Computer Science, New York, USA"
    }
    

Abstract

One of the fundamental issues in Computer Science is the ordering of a list of items - known as sorting. Sorting algorithms such as the Bubble, Insertion and Selection Sort, all have a quadratic time complexity O(N2) that limits their use when the number of elements is very large. This paper presents Use-Me sort. It sorts a list by making the use of already sorted elements present in the list. Moreover, it provides a trade-off between Space and Time Complexity with better performance than the existing sorting algorithms of the O (N2) class.

Reference

  1. Knuth D. E. , "The art of programming- sorting and searching". Addison-Wesley.
  2. Cormen T. , Leiserson C. , Rivest R. , and Stein C. , "Introduction to Algorithms," McGraw Hill.
  3. Sedgewick, Algorithms in C++, pp. 98-100, ISBN 0-201-51059-6, Addison-Wesley.
  4. Seymour Lipschutz, G A Vijayalakshmi Pai (2006), "Data Structures", Tata McGraw-Hill Publishing Company Limited.
  5. Song Qin, "Merge Sort Algorithm" Florida Institute of Technology.
  6. Vandana Sharma, Satwinder Singh and Dr. K. S. Kahlon, "Performance Study of Improved Heap Sort Algorithm and Other Sorting Algorithms on Different Platforms (2008), "IJCSNS International Journal of Computer Science and Network Security, VOL. 8 No. 4.
  7. You Yang, Ping Yu, Yan Gan, "Experimental Study on the Five Sort Algorithms", International Conference on Mechanic Automation and Control Engineering (MACE), 2011.
  8. Kaur S. , Sodhi T. S. , Kumar P. , (2012) "Freezing Sort". International Journal of Applied Information Systems (IJAIS), vol. 2, no. 4, pp. 18–21.
  9. Gurram, H. K. , GovardhanaBabuKolli, (2011). Average Sort. International Journal of Experimental Algorithms (IJEA), vol. 2, no. 2, pp. 48–54.
  10. Wang Min "Analysis on 2-Element Insertion Sort Algorithm", International Conference on Computer Design And Appliations (ICCDA), 2010.
  11. Blum, M. , Floyd, R. W. , Pratt, V. , Rivest, R. L. , Tarjan, R. E. , (1973). Time Bounds for Selection. Journal of Computer and System Sciences, vol. 7, no. 4, pp. 448–461.

Keywords

Algorithm, Complexity, Insertion Sort