Additional homework notes:
newalg
from TUG
and clrscode
from Cormen.
I will answer questions about clrscode
and Xiaolin
will answer questions about newalg
. The initial
installation appears to be a bit easier with clrscode
.
For clrscode
, there is documentation
available. Do the following:
clrscode.sty
clrscode.sty
in a directory, like
~/latex
TEXINPUTS
to
".:$HOME/latex::
" with a command like
setenv TEXINPUTS .:$HOME/latex::
(This can go in .cshrc
. Alternatively, you
could put clrscode.sty
in the same directory as the
source file.).tex
extension, e.g.,
by modifying example.tex
pdflatex example.tex
to produce
example.pdf
newalg
from TUG
and clrscode
from Cormen.
I will answer questions about clrscode
and Xiaolin
will answer questions about newalg
. The initial
installation appears to be a bit easier with clrscode
.
For clrscode
, there is documentation
available. Do the following:
clrscode.sty
clrscode.sty
in a directory, like
~/latex
TEXINPUTS
to
".:$HOME/latex::
" with a command like
setenv TEXINPUTS .:$HOME/latex::
(This can go in .cshrc
. Alternatively, you
could put clrscode.sty
in the same directory as the
source file.).tex
extension, e.g.,
by modifying example.tex
pdflatex example.tex
to produce
example.pdf
example2.pdf
.
The source is example2.tex
and the included figure is tree.eps
1 5 4 9
are
1 4 9
and 1 5 9
. Your solution should
return some maximal subsequence, but need not return all of
them. If you're stuck on this, you can write up 15.4-5 (quadratic
time version) for partial credit.