1 Hit in 12.7 sec

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

Peeyush Kumar, Ayushe Gangal, Sunita Kumari
2020 Ingénierie des Systèmes d'Information  
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  ...  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.  ...  This novel method, called Recombinant Sort, combines the counting sort, bucket sort and radix sort, along with hashing and dynamic programming to elevate efficiency.  ... 
doi:10.18280/isi.250513 fatcat:g54ufrrsinc6vfohuourza63qi