TwinArray Sort: An Ultrarapid Conditional Non-Comparison Based Sorting Algorithm
Amin Amini

TL;DR
TwinArray Sort is a new non-comparison-based sorting algorithm that achieves linear time complexity with efficient memory use, outperforming traditional methods across various data distributions, especially for large datasets.
Contribution
It introduces a novel conditional non-comparison-based sorting algorithm utilizing dual auxiliary arrays and a distinct array verifier for improved efficiency and memory management.
Findings
Outperforms conventional algorithms in diverse data distributions.
Achieves worst-case time and space complexity of O(n+k).
Effective for large datasets and machine learning applications.
Abstract
In computer science, sorting algorithms are crucial for data processing and machine learning. Large datasets and high efficiency requirements provide challenges for comparison-based algorithms like Quicksort and Merge sort, which achieve O(n log n) time complexity. Non-comparison-based algorithms like Spreadsort and Counting Sort have memory consumption issues and a relatively high computational demand, even if they can attain linear time complexity under certain circumstances. We present TwinArray Sort, a novel conditional non-comparison-based sorting algorithm that effectively uses array indices. When it comes to worst-case time and space complexities, TwinArray Sort achieves O(n+k). The approach remains efficient under all settings and works well with datasets with randomly sorted, reverse-sorted, or nearly sorted distributions. TwinArray Sort can handle duplicates and optimize…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · DNA and Biological Computing · Graph Theory and Algorithms
