Longest increasing subsequence: Difference between revisions

Content added Content deleted
Line 441: Line 441:
import Data.List.Ordered
import Data.List.Ordered


⚫
-- longest increasing
lis :: Ord a => [a] -> [a]
lis :: Ord a => [a] -> [a]
lis = maximumBy (comparing length) . filter isSorted . subsequences
lis = maximumBy (comparing length) -- longest
⚫
. filter isSorted -- increasing
. subsequences -- all


main = do
main = do
Retrieved from "https://rosettacode.org/wiki/Longest_increasing_subsequence"