{"id":7005,"date":"2022-05-09T13:25:22","date_gmt":"2022-05-09T11:25:22","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=7005"},"modified":"2022-05-14T10:42:42","modified_gmt":"2022-05-14T08:42:42","slug":"minimo-producto-escalar","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/minimo-producto-escalar\/","title":{"rendered":"M\u00ednimo producto escalar"},"content":{"rendered":"<p>El producto escalar de los vectores [a1,a2,&#8230;,an] y [b1,b2,&#8230;, bn] es<\/p>\n<pre lang=\"text\">\n   a1 * b1 + a2 * b2 + \u00b7\u00b7\u00b7 + an * bn.\n<\/pre>\n<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   menorProductoEscalar :: (Ord a, Num a) => [a] -> [a] -> a\n<\/pre>\n<p>tal que <code>(menorProductoEscalar xs ys)<\/code> es el m\u00ednimo de los productos escalares de las permutaciones de <code>xs<\/code> y de las permutaciones de <code>ys<\/code>. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   menorProductoEscalar [3,2,5]  [1,4,6]    == 29\n   menorProductoEscalar [3,2,5]  [1,4,-6]   == -19\n   menorProductoEscalar [1..10^2] [1..10^2] == 171700\n   menorProductoEscalar [1..10^3] [1..10^3] == 167167000\n   menorProductoEscalar [1..10^4] [1..10^4] == 166716670000\n   menorProductoEscalar [1..10^5] [1..10^5] == 166671666700000\n   menorProductoEscalar [1..10^6] [1..10^6] == 166667166667000000\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nmodule Minimo_producto_escalar where\n\nimport Data.List (sort, permutations)\nimport Test.QuickCheck (quickCheck)\n\n-- 1\u00aa soluci\u00f3n\n-- ===========\n\nmenorProductoEscalar1 :: (Ord a, Num a) => [a] -> [a] -> a\nmenorProductoEscalar1 xs ys =\n  minimum [sum (zipWith (*) pxs pys) | pxs <- permutations xs,\n                                       pys <- permutations ys]\n\n-- 2\u00aa soluci\u00f3n\n-- ===========\n\nmenorProductoEscalar2 :: (Ord a, Num a) => [a] -> [a] -> a\nmenorProductoEscalar2 xs ys =\n  minimum [sum (zipWith (*) pxs ys) | pxs <- permutations xs]\n\n-- 3\u00aa soluci\u00f3n\n-- ===========\n\nmenorProductoEscalar3 :: (Ord a, Num a) => [a] -> [a] -> a\nmenorProductoEscalar3 xs ys =\n  sum (zipWith (*) (sort xs) (reverse (sort ys)))\n\n-- Equivalencia\n-- ============\n\n-- La propiedad es\nprop_menorProductoEscalar :: [Integer] -> [Integer] -> Bool\nprop_menorProductoEscalar xs ys =\n  all (== menorProductoEscalar1 xs' ys')\n      [menorProductoEscalar2 xs' ys',\n       menorProductoEscalar3 xs' ys']\n  where n   = min (length xs) (length ys)\n        xs' = take n xs\n        ys' = take n ys\n\n-- La comprobaci\u00f3n es\n--    \u03bb> quickCheckWith (stdArgs {maxSize=7}) prop_menorProductoEscalar\n--    +++ OK, passed 100 tests.\n\n-- Comparaci\u00f3n de eficiencia\n-- =========================\n\n-- La comparaci\u00f3n es\n--    \u03bb> menorProductoEscalar1 [0..5] [0..5]\n--    20\n--    (3.24 secs, 977385528 bytes)\n--    \u03bb> menorProductoEscalar2 [0..5] [0..5]\n--    20\n--    (0.01 secs, 4185776 bytes)\n--\n--    \u03bb> menorProductoEscalar2 [0..9] [0..9]\n--    120\n--    (23.86 secs, 9342872784 bytes)\n--    \u03bb> menorProductoEscalar3 [0..9] [0..9]\n--    120\n--    (0.01 secs, 2580824 bytes)\n--\n--    \u03bb> menorProductoEscalar3 [0..10^6] [0..10^6]\n--    166666666666500000\n--    (2.46 secs, 473,338,912 bytes)\n<\/pre>\n<p>El c\u00f3digo se encuentra en <a href=\"https:\/\/github.com\/jaalonso\/Exercitium\/blob\/main\/src\/Minimo_producto_escalar.hs\">GitHub<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>El producto escalar de los vectores [a1,a2,&#8230;,an] y [b1,b2,&#8230;, bn] es a1 * b1 + a2 * b2 + \u00b7\u00b7\u00b7 + an * bn. Definir la funci\u00f3n menorProductoEscalar :: (Ord a, Num a) => [a] -> [a] -> a tal que (menorProductoEscalar xs ys) es el m\u00ednimo de los productos escalares de las permutaciones de&#8230;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[2],"tags":[569,8,498,340,11,228,32,14,40,146,467],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7005"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/comments?post=7005"}],"version-history":[{"count":2,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7005\/revisions"}],"predecessor-version":[{"id":7020,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/7005\/revisions\/7020"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=7005"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=7005"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=7005"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}