Use-Me Sort: A New Sorting Algorithm
Mohit Sehgal, Nihal Kumar · International Journal of Applied Information Systems · 2014
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(N 2 ) 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 (N 2 ) class.