Anonymous user
Longest increasing subsequence: Difference between revisions
added Haskell
(Second D version) |
(added Haskell) |
||
Line 198:
<pre>[ 2 4 5 ]
[ 0 2 6 9 11 15 ]</pre>
=={{header|Haskell}}==
<lang Haskell>import Data.Ord
import Data.List
import Data.List.Ordered
lis = maximumBy (comparing length) . filter isSorted . subsequences
main = do
print $ lis [3,2,6,4,5,1]
print $ lis [0,8,4,12,2,10,6,14,1,9,5,13,3,11,7,15]</lang>
{{out}}
<pre>[2,4,5]
[0,2,6,9,11,15]</pre>
=={{header|Icon}} and {{header|Unicon}}==
| |||