Figure 7From: Sampling solution traces for the problem of sorting permutations by signed reversalsAverage number of traces produced by each algorithm in 60 seconds. Sets of 100 random permutations with 40 ≤ n ≤ 200 and d(π) = ⌈(n + 1)/2⌉ were generated and processed with the algorithms RA, DFALT, SWA4, SWA5, and SWA6 during a time limit of 60 seconds. The plot shows the average number of traces produced by each algorithm for each set of permutations.Back to article page