Figure 2From: Listing all sorting reversals in quadratic timeRunning times. Average running times on random permutations of Siepel and the ominous substrings algorithms for 100 ≤ n ≤ 1000.Back to article page
