An O(N) Sorting Algorithm: Machine Learning Sort
classification
💻 cs.LG
cs.DSstat.ML
keywords
sortingalgorithmlearningmachineaccelerationapplicationappliedcdot
read the original abstract
We propose an $O(N\cdot M)$ sorting algorithm by Machine Learning method, which shows a huge potential sorting big data. This sorting algorithm can be applied to parallel sorting and is suitable for GPU or TPU acceleration. Furthermore, we discuss the application of this algorithm to sparse hash table.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.