Longest increasing subsequence: Difference between revisions
Content added Content deleted
| Line 436: | Line 436: | ||
=={{header|Haskell}}== |
=={{header|Haskell}}== |
||
===Naive implementation=== |
===Naive implementation=== |
||
<lang Haskell>import Data.Ord |
<lang Haskell>import Data.Ord ( comparing ) |
||
import Data.List |
import Data.List.Ordered ( isSorted ) |
||
import Data.List.Ordered |
|||
lis :: Ord a => [a] -> [a] |
lis :: Ord a => [a] -> [a] |
||
lis = maximumBy (comparing length) . filter isSorted . subsequences |
lis = maximumBy (comparing length) . filter isSorted . subsequences |
||
-- longest <-- increasing <-- all |
-- longest <-- increasing <-- all |
||
main = do |
main = do |
||