Sorting by Swaps with Noisy Comparisons

1 code implementation • 12 Mar 2018 • Tomáš Gavenčiak, Barbara Geissmann, Johannes Lengler

We study sorting of permutations by random swaps if each comparison gives the wrong result with some fixed probability $p<1/2$.