  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.
