We present a sorting algorithm for the case of recurrent random comparison errors. The algorithm essentially achieves simultaneously good properties of previous algorithms for sorting n distinct elements in this model. In particular, it runs in O(n2) time, the maximum dislocation of the elements in the output is O(logn), while the total dislocation is O(n). These guarantees are the best possibl...
