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