Longest increasing subsequence: Difference between revisions

Content added Content deleted
Line 459:
lis :: Ord a => [a] -> [a]
lis lst = runST $ do
pileTopslet <-llst newSTArray (1,= length lst) []
pileTops <- newSTArray (min llst 1, lst) []
let bsearchPiles x len = aux 1 len where
aux lo hi | lo > hi = return lo
Retrieved from "https://rosettacode.org/wiki/Longest_increasing_subsequence"