Definir la funci\u00f3n<\/p>\n
\n iguales :: Ord a => [a] -> [a] -> Bool\n<\/pre>\ntal que iguales xs ys<\/code> se verifica si xs<\/code> e ys<\/code> son iguales como conjuntos. Por ejemplo,<\/p>\n\n iguales [3,2,3] [2,3] == True\n iguales [3,2,3] [2,3,2] == True\n iguales [3,2,3] [2,3,4] == False\n iguales [2,3] [4,5] == False\n<\/pre>\nSoluciones<\/b><\/p>\n
A continuaci\u00f3n se muestran las soluciones en Haskell<\/a> y las soluciones en Python<\/a>.<\/p>\n<\/a>
\nSoluciones en Haskell<\/b><\/p>\n\nimport Data.List (nub, sort)\nimport Data.Set (fromList)\nimport Test.QuickCheck\n\n-- 1\u00aa soluci\u00f3n\n-- ===========\n\niguales1 :: Ord a => [a] -> [a] -> Bool\niguales1 xs ys =\n subconjunto xs ys && subconjunto ys xs\n\n-- (subconjunto xs ys) se verifica si xs es un subconjunto de ys. Por\n-- ejemplo,\n-- subconjunto [3,2,3] [2,5,3,5] == True\n-- subconjunto [3,2,3] [2,5,6,5] == False\nsubconjunto :: Ord a => [a] -> [a] -> Bool\nsubconjunto xs ys =\n [x | x <- xs, x `elem` ys] == xs\n\n-- 2\u00aa soluci\u00f3n\n-- ===========\n\niguales2 :: Ord a => [a] -> [a] -> Bool\niguales2 xs ys =\n nub (sort xs) == nub (sort ys)\n\n-- 3\u00aa soluci\u00f3n\n-- ===========\n\niguales3 :: Ord a => [a] -> [a] -> Bool\niguales3 xs ys =\n fromList xs == fromList ys\n\n-- Comprobaci\u00f3n de equivalencia\n-- ============================\n\n-- La propiedad es\nprop_iguales :: [Int] -> [Int] -> Bool\nprop_iguales xs ys =\n all (== iguales1 xs ys)\n [iguales2 xs ys,\n iguales3 xs ys]\n\n-- La comprobaci\u00f3n es\n-- \u03bb> quickCheck prop_iguales\n-- +++ OK, passed 100 tests.\n\n-- Comparaci\u00f3n de eficiencia\n-- =========================\n\n-- La comparaci\u00f3n es\n-- \u03bb> iguales1 [1..2*10^4] [1..2*10^4]\n-- True\n-- (4.05 secs, 8,553,104 bytes)\n-- \u03bb> iguales2 [1..2*10^4] [1..2*10^4]\n-- True\n-- (4.14 secs, 9,192,768 bytes)\n-- \u03bb> iguales3 [1..2*10^4] [1..2*10^4]\n-- True\n-- (0.01 secs, 8,552,232 bytes)\n<\/pre>\nEl c\u00f3digo se encuentra en GitHub<\/a>.<\/p>\n