TL;DR
This paper introduces Cantor Mapping, a novel string ordering technique that enables efficient string comparison sorting in loglinear time with linear space, improving sorting performance for string data.
Contribution
The paper presents a new Cantor Mapping method for string comparison, achieving faster sorting with linear space complexity, which is a significant advancement over existing techniques.
Findings
String comparison sorting achieved in loglinear time.
Uses linear extra space for sorting.
Effective for string ordering tasks.
Abstract
A new technique specific to String ordering utilizing a method called "Cantor Mapping" is explained in this paper and used to perform string comparative sort in loglinear time while utilizing linear extra space.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Cellular Automata and Applications · semigroups and automata theory