comparison-based sorting 1in-place sorting 1minimal moves 1randomized algorithms 1worst-case analysis 1
From the 1 of 2 linked papers with an AI index.
2 papers
cs.DS2026
Straightforward Entropy-Sensitive Mergesort
Bill Jin, Alex Zihan Xu
In this paper, we present a stable mergesort variant, "directional mergesort", that to sort an array of elements makes no more than comparisons and moves w…
cs.DS2026
Upper Bounds for In-Place Sorting with Minimal Moves
Alex Zihan Xu, Stephen Jing Chick
The paper introduces an in-place comparison‑based sorting algorithm that uses only O(n) element moves while achieving n·log n + O(n) comparisons with high probability, and provides…