Algorithm Summary

Figure 11.12 gives a schematic description of the algorithm.

  

Figure 11.12: Sorting signed permutations

Theorem 11.16   Algorithm SIGNED REVERSALS finds the reversal distance r in time, and in particular in O(n²) time.

Proof:Step 1 takes time by the algorithm of Berman and Hannenhalli [4]. Step 2 takes O(n) time. Step 3 takes O(n) time per reversal, by the previous discussion.