[Openmcl-devel] bit string matching

Lou Vanek lou.vanek at gmail.com
Tue Jan 4 14:07:03 PST 2011

This is an n^2 algorithm in time, and can be solved in n^2 space (and less).

There isn't a max-palindrome operator in lisp, but it's not hard to write.
Ask yourself what you want to do first, and write some psuedocode
before trying to decide what lisp operators you want to use. If you
aren't able to formulate the algorithm in psuedocode then you wont be
able to code it (correctly).

Believe it or not, the algorithm analysis I list at the top of this
email should give you two hints on how to solve it.

BTW, this looks like it could be homework.

More information about the Openmcl-devel mailing list