Treffer: SlowSort: An Enhanced Sorting Algorithm for Large‐Scale Integer Datasets.

sort). Results: On small datasets, SlowSort outperforms parallel sorting and matches radix sort. For medium datasets, its performance is comparable to both. On large datasets, SlowSort is 50% slower than parallel and radix sorts but reduces peak memory usage by 50%. Across all scales, SlowSort is over eight times faster than standard library algorithms. Discussion & Conclusion: SlowSort offers an effective solution for large‐scale integer deduplication sorting in resource‐constrained environments, balancing performance and engineering practicality. [ABSTRACT FROM AUTHOR]

Copyright of Software: Practice & Experience is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)