HackerPapers

arXiv:1805.04272cs.LG

An $O(N)$ Sorting Algorithm: Machine Learning Sort

Hanqing Zhao, Yuehan Luo

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

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.

arXiv comments
5 pages, 5 figures
Journal reference
DOI
Subjects
cs.LGMachine Learning cs.DSData Structures and Algorithms stat.MLMachine Learning (Statistics)

On Hacker News

No comments linking this paper were found in the collected sources. Found in 2 HN submissions from May 2018 to Aug 2018. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.