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

Hanqing Zhao; Yuehan Luo

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1805.04272 v2 pith:G4XRDQXS submitted 2018-05-11 cs.LG cs.DSstat.ML

Hanqing Zhao , Yuehan Luo This is my paper · ORCID

classification cs.LGcs.DSstat.ML

keywords sortingalgorithmlearningmachineaccelerationapplicationappliedcdot

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

EZ-Sort: Efficient Pairwise Comparison via Zero-Shot CLIP-Based Pre-Ordering and Human-in-the-Loop Sorting
cs.CV 2025-08 conditional novelty 6.0 of 10

Zero-shot CLIP pre-ordering plus uncertainty-guided MergeSort reduces human pairwise-comparison annotations by up to 90.5% and by 19.8% over prior active sorting.

Pith tools