Data Structures and Algorithms

1711 Submissions

[1] viXra:1711.0118 [pdf] replaced on 2017-11-03 10:00:49

Just Sort

Authors: Sathish Kumar Vijayakumar
Comments: 12 Pages. Hi though sorting is one of the vastly researched area, this paper brings out the best time complexity of them all. My linkedin profile is as follows http://linkedin.com/in/sathish-kumar-b7434579. Please feel free to post your queries.

Sorting is one of the most researched topics of Computer Science and it is one of the essential operations across computing devices. Given the ubiquitous presence of computers, sorting algorithms utilize significant percentage of computation times across the globe. In this paper we present a sorting algorithm with worst case time complexity of O(n) without any assumptions on the nature of the input data.
Category: Data Structures and Algorithms