Anonymous user
Longest increasing subsequence: Difference between revisions
→Patience sorting
Line 460:
lis xs = runST $ do
let lxs = length xs
pileTops <- newSTArray (min lxs 1,
let bsearchPiles x len = aux 1 len where
aux lo hi | lo > hi = return lo
|