Listas disjuntas

3 Comentarios

1. Haskell

   disjuntas :: Ord a => [a] -> [a] -> Bool disjuntas [] _ = True disjuntas _ [] = True disjuntas (x:xs) (y:ys) | x <= y = if last xs < y then True else not (any (\x-> elem x ys) (dropWhile (<=y) xs)) | otherwise = if x > last ys then True else not (any (\y-> elem y xs) (dropWhile (<=x) ys))

   1 2 3 4 5 6 7 8 9 10

   disjuntas :: Ord a => [a] -> [a] -> Bool disjuntas [] _ = True disjuntas _ [] = True disjuntas (x:xs) (y:ys)     | x <= y    = if last xs < y                   then True                   else not (any (\x-> elem x ys) (dropWhile (<=y) xs))     | otherwise = if x > last ys                   then True                   else not (any (\y-> elem y xs) (dropWhile (<=x) ys))

   De esta forma, ejemplos como:

   Haskell

   disjuntas [1..1000000] [900000..4000000] False (0.98 secs, 41243112 bytes)

   1 2 3

   disjuntas [1..1000000] [900000..4000000] False (0.98 secs, 41243112 bytes)

   son calculados en poco tiempo

   Responder

2. Haskell

   disjuntas xs ys = null [x|x<-xs, y<-ys, x==y]

   1	disjuntas xs ys = null [x|x<-xs, y<-ys, x==y]

   Responder

3. Haskell

   disjuntas [] _ = True disjuntas _ [] = True disjuntas (x:xs) (y:ys) = x /= y && (if x > y then disjuntas xs (y:ys) else disjuntas (x:xs) ys)

   1 2 3 4

   disjuntas [] _ = True disjuntas _ [] = True disjuntas (x:xs) (y:ys) =     x /= y && (if x > y then disjuntas xs (y:ys) else disjuntas (x:xs) ys)

   Responder