- lcs a-ls b-ls #!optional (eq equal?)procedure
Finds the longest common Subsequence between a-ls and b-ls, comparing elements with eq (default equal?). Returns this sequence as a list, using the elements from a-ls. Uses quadratic time and space.
Finds the longest common Subsequence between a-ls and b-ls, comparing elements with eq (default equal?). Returns this sequence as a list, using the elements from a-ls. Uses quadratic time and space.