Recombinant Sort: N-Dimensional Cartesian Spaced Algorithm Designed from Synergetic Combination of Hashing, Bucket, Counting and Radix Sort

by   Peeyush Kumar, et al.

Sorting is an essential operation which is widely used and is fundamental to some very basic day to day utilities like searches, databases, social networks and much more. Optimizing this basic operation in terms of complexity as well as efficiency is cardinal. Optimization is achieved with respect to space and time complexities of the algorithm. In this paper, a novel left-field N-dimensional cartesian spaced sorting method is proposed by combining the best characteristics of bucket sort, counting sort and radix sort, in addition to employing hashing and dynamic programming for making the method more efficient. Comparison between the proposed sorting method and various existing sorting methods like bubble sort, insertion sort, selection sort, merge sort, heap sort, counting sort, bucket sort, etc., has also been performed. The time complexity of the proposed model is estimated to be linear i.e. O(n) for the best, average and worst cases, which is better than every sorting algorithm introduced till date.


page 1

page 3

page 4


Sorting Real Numbers in O(n√( n)) Time and Linear Space

We present an O(n√( n)) time and linear space algorithm for sorting real...

An efficient sorting algorithm - Ultimate Heapsort(UHS)

Motivated by the development of computer theory, the sorting algorithm i...

An Answer to the Bose-Nelson Sorting Problem for 11 and 12 Channels

We show that 11-channel sorting networks have at least 35 comparators an...

Merge Non-Dominated Sorting Algorithm for Many-Objective Optimization

Many Pareto-based multi-objective evolutionary algorithms require to ran...

Fast Differentiable Sorting and Ranking

The sorting operation is one of the most basic and commonly used buildin...

Sorting an Array Using the Topological Sort of a Corresponding Comparison Graph

The quest for efficient sorting is ongoing, and we will explore a graph-...

Accelerating Big-Data Sorting Through Programmable Switches

Sorting is a fundamental and well studied problem that has been studied ...