works on
comparison-based sorting 1in-place sorting 1minimal moves 1randomized algorithms 1worst-case analysis 1

From the 1 of 1 linked paper with an AI index.

collaborators
Showing cs.DSShow all

1 paper · 1 filter

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…