Circular sorting
Ron M. Adin, Noga Alon, Yuval Roichman
TL;DR
This paper investigates the minimal number of adjacent swaps needed to sort n labeled points on a circle and provides lower bounds for sorting with all swaps, highlighting the complexity of circular sorting.
Contribution
It introduces bounds on the number of steps for circular sorting and extends analysis to all swaps, advancing understanding of sorting complexities in circular arrangements.
Findings
Maximum steps for adjacent swaps on a circle determined
Lower bounds for all-swap sorting established
Insights into circular sorting complexity provided
Abstract
We determine the maximal number of steps required to sort labeled points on a circle by adjacent swaps. Lower bounds for sorting by all swaps, not necessarily adjacent, are given as well.
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
TopicsGenome Rearrangement Algorithms