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