CFP last date
16 December 2024
Call for Paper
January Edition
IJAIS solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 16 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Ordered Frequent Itemsets Matrix Based On Fp-Tree Structure And Apriori Algorithm

Abdulkader M. Al-Badani Abdualmajed A. Al-Khulaidi
Random Articles
Reseach Article

Use-Me Sort: A New Sorting Algorithm

by Mohit Sehgal, Nihal Kumar
journal cover thumbnail

International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
Volume 7 - Number 8
Year of Publication: 2014
Authors: Mohit Sehgal, Nihal Kumar
10.5120/ijais14-451228

Mohit Sehgal, Nihal Kumar . Use-Me Sort: A New Sorting Algorithm. International Journal of Applied Information Systems. 7, 8 ( September 2014), 19-22. DOI=10.5120/ijais14-451228

@article{ 10.5120/ijais14-451228,
author = { Mohit Sehgal, Nihal Kumar },
title = { Use-Me Sort: A New Sorting Algorithm },
journal = { International Journal of Applied Information Systems },
issue_date = { September 2014 },
volume = { 7 },
number = { 8 },
month = { September },
year = { 2014 },
issn = { 2249-0868 },
pages = { 19-22 },
numpages = {9},
url = { https://www.ijais.org/archives/volume7/number8/675-1228/ },
doi = { 10.5120/ijais14-451228 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-07-05T18:55:26.171680+05:30
%A Mohit Sehgal
%A Nihal Kumar
%T Use-Me Sort: A New Sorting Algorithm
%J International Journal of Applied Information Systems
%@ 2249-0868
%V 7
%N 8
%P 19-22
%D 2014
%I Foundation of Computer Science (FCS), NY, 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.

References
  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.
Index Terms

Computer Science
Information Sciences

Keywords

Algorithm Complexity Insertion Sort

Powered by PhDFocusTM