next up previous
Next: Open Problems Up: An Algorithm for Sorting Previous: Computing the Unoriented Degrees

   
Algorithm Summary

Figure 10.13 gives a schematic description of the algorithm.


  
Figure 10.13: Sorting signed permutations
\framebox{\begin{minipage}{\textwidth} \begin{tabbing} \ \ \ \ \= \ \ \ \ \= \... ... the sequence of reversals. \\ \< {\bf end} \-\\ \end{tabbing} \end{minipage}}


\begin{theorem}Algorithm {\sc Signed Reversals} finds the reversal distance $r$ ... ...r \cdot n )$\space time, and in particular in $O(n^2)$\space time. \end{theorem}

\begin{proof}Step 1 takes $O(n\alpha (n) )$\space time by the algorithm of Berma... ... 3 takes $O(n)$\space time per reversal, by the previous discussion. \end{proof}


Peer Itsik
2001-01-17