Algorithm


\begin{algorithm}
{LCS-Length}{X,Y}
 m \= \mbox{\em length}[X] \  n \= \mbox{\e...
 ...end{IF} \end{IF} \end{FOR} \end{FOR} \  \RETURN c \mbox{ and } b\end{algorithm}


next up previous
Next: General Running-Time Analysis for Up: LONGEST COMMON SUBSEQUENCE Previous: Recursive Formula