Optimal Dislocation with Persistent Errors in Subquadratic Time

We study the problem of sorting N elements in the presence of persistent errors in comparisons: In this classical model, each comparison between two elements is wrong independently with some probability up to p , but repeating the same comparison gives always the same result. In this model, it is impossible to reliably compute a perfectly sorted permutation of the input elements. Rather, the quality of a sorting algorithm is often evaluated w.r.t. the maximum dislocation of the sequences it computes, namely, the maximum absolute difference between the position of an element in the returned sequence and the position of the same element in the perfectly sorted sequence. The best known algorithms for this problem have running time O ( N 2 ) and achieve, w.h.p., an optimal maximum dislocation of O ( log N ) $O(\log N)$ for constant error probability p . Note that no algorithm can achieve maximum dislocation o ( log N ) $o(\log N)$ w.h.p., regardless of its running time. In this work we present the first subquadratic time algorithm with optimal maximum dislocation. Our algorithm runs in O ~ ( N 3 / 2 ) $\widetilde {O}(N^{3/2})$ time and it guarantees O ( log N ) $O(\log N)$ maximum dislocation with high probability for any p ≤ 1/16.