Intersección de listas infinitas crecientes

5 Comentarios

1. Haskell

   interseccion :: Ord a => [[a]] -> [a] interseccion xss = mira (rompe xss) rompe :: Ord a => [[a]] -> ([a], [[a]]) rompe xss = (head xss, tail xss) mira :: Ord a => ([a], [[a]]) -> [a] mira (x:xs, yss) | and [elem x ys | ys <- map (takeWhile (<= x)) yss] = [x] ++ mira (xs, yss) | otherwise = mira (xs,yss)

   1 2 3 4 5 6 7 8 9 10

   interseccion :: Ord a => [[a]] -> [a] interseccion xss = mira (rompe xss) rompe :: Ord a => [[a]] -> ([a], [[a]]) rompe xss = (head xss, tail xss) mira :: Ord a => ([a], [[a]]) -> [a] mira (x:xs, yss)   | and [elem x ys | ys <- map (takeWhile (<= x)) yss] = [x] ++ mira (xs, yss)   | otherwise                                          = mira (xs,yss)

   Responder

2. Haskell

   interseccion :: Ord a => [[a]] -> [a] interseccion (xs:xss) = [x | x <- xs, and [pertenece x ys | ys <- xss]] pertenece :: Ord a => a -> [a] -> Bool pertenece x xs = elem x (takeWhile (<=x) xs)

   1 2 3 4 5

   interseccion :: Ord a => [[a]] -> [a] interseccion (xs:xss) = [x | x <- xs, and [pertenece x ys | ys <- xss]] pertenece :: Ord a => a -> [a] -> Bool pertenece x xs = elem x (takeWhile (<=x) xs)

   Responder

3. Haskell

   interseccion :: Ord a => [[a]] -> [a] interseccion (xs:xss) | elem [] (xs:xss) = [] | otherwise = [x | x <- xs, pertenecer x xss] pertenecer :: Ord a => a -> [[a]] -> Bool pertenecer a [] = True pertenecer a (xs:xss) = elem a (takeWhile (<=a) xs) && pertenecer a xss

   1 2 3 4 5 6 7 8

   interseccion :: Ord a => [[a]] -> [a] interseccion (xs:xss)   | elem [] (xs:xss) = []   | otherwise        = [x | x <- xs, pertenecer x xss] pertenecer :: Ord a => a -> [[a]] -> Bool pertenecer a []       = True pertenecer a (xs:xss) = elem a (takeWhile (<=a) xs) && pertenecer a xss

   Responder

4. Haskell

   interseccion :: Ord a => [[a]] -> [a] interseccion (xs:xss) = [x | x <- xs, pertenece x xss] where pertenece x xss = all (elem x) [takeWhile (<=x) ys | ys <- xss]

   1 2 3

   interseccion :: Ord a => [[a]] -> [a] interseccion (xs:xss) = [x | x <- xs, pertenece x xss]   where pertenece x xss = all (elem x) [takeWhile (<=x) ys | ys <- xss]

   Responder

5. Haskell

   interseccion :: Ord a => [[a]] -> [a] interseccion (xs:xss) = [x | x <-xs, and [ x `elem` ys | ys <- map (takeWhile (<=x)) xss]]

   1 2 3

   interseccion :: Ord a => [[a]] -> [a] interseccion (xs:xss) =   [x | x <-xs, and [ x `elem` ys | ys <- map (takeWhile (<=x)) xss]]

   Responder