Longest increasing subsequence: Difference between revisions

Content added Content deleted
Line 441:
import Data.List.Ordered
 
-- longest increasing▼
lis :: Ord a => [a] -> [a]
lis = maximumBy (comparing length) .-- filterlongest isSorted . subsequences
▲-- longest . filter isSorted -- increasing
. subsequences -- all
 
main = do
Retrieved from "https://rosettacode.org/wiki/Longest_increasing_subsequence"