Order disjoint list items: Difference between revisions

→‎{{header|Haskell}}: simplify cases
(→‎{{header|Haskell}}: minor improvement)
(→‎{{header|Haskell}}: simplify cases)
Line 696:
ks = zip ms [(0::Int)..]
ls = zip ns.sort.snd.foldl go (sort ns,[]).sort $ ks
yu []((u,v):us) (x_,_y) | v == y = ([]us,xu)
yu (ys@((u,v):us)) (x,y_) = if v == y then (us,u) else = (ys,x)
go ([](u:us),ys) _ (x,y) | u == x = ([]us,y:ys)
go ts@(xs@(u:us),ys) (x,y)_ = if u == x then (us,y:ys) else = ts
task ls@[ms,ns] = do
Anonymous user