An O(N) Sorting Algorithm Machine Learning Sort | Awesome Learning to Hash Add your paper to Learning2Hash

An O(N) Sorting Algorithm Machine Learning Sort

Zhao Hanqing, Luo Yuehan. Arxiv 2018

[Paper]    
ARXIV

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.

Similar Work