Optimal and Robust Sorting of Evolving Data Using a Simple Randomized Algorithm

A simple randomized sorting algorithm, called Naïve Sort, achieves optimal total deviation and maximum deviation from the true order of evolving data, under very general model settings.