Figure 4From: Sampling solution traces for the problem of sorting permutations by signed reversalsAverage execution time. Sets of 500 random permutations (linear and circular) with 10 and 15 elements and different reversal distances were processed with the DFA algorithm. For each set, we calculated the average execution time. The horizontal dotted line indicates 30 seconds.Back to article page