{"id":1941,"date":"2026-03-29T03:11:21","date_gmt":"2026-03-29T01:11:21","guid":{"rendered":"https:\/\/labodemaths.fr\/WordPress3\/?p=1941"},"modified":"2026-04-02T16:57:12","modified_gmt":"2026-04-02T14:57:12","slug":"nsi-algorithmes-gloutons-2","status":"publish","type":"post","link":"https:\/\/labodemaths.fr\/WordPress3\/nsi-algorithmes-gloutons-2\/","title":{"rendered":"NSI : algorithmes gloutons"},"content":{"rendered":"\n<blockquote class=\"wp-block-quote\"><p>Un algorithme est une suite finie et non ambigu\u00eb d&rsquo;instructions et d\u2019op\u00e9rations permettant de r\u00e9soudre une classe de probl\u00e8mes. Le domaine qui \u00e9tudie les algorithmes est appel\u00e9 l&rsquo;algorithmique.<\/p><cite>Wikip\u00e9dia<\/cite><\/blockquote>\n\n\n\n<div class=\"wp-block-file\"><a href=\"https:\/\/labodemaths.fr\/WordPress3\/wp-content\/uploads\/2022\/04\/Algo_gloutons.pdf\">Algo_gloutons<\/a><a href=\"https:\/\/labodemaths.fr\/WordPress3\/wp-content\/uploads\/2022\/04\/Algo_gloutons.pdf\" class=\"wp-block-file__button\" download>T\u00e9l\u00e9charger<\/a><\/div>\n\n\n\n<div class=\"wp-block-file\"><a href=\"https:\/\/labodemaths.fr\/WordPress3\/wp-content\/uploads\/2022\/04\/Algorithmes-de-rangement_fiche_eleve.pdf\">Algorithmes-de-rangement_fiche_eleve<\/a><a href=\"https:\/\/labodemaths.fr\/WordPress3\/wp-content\/uploads\/2022\/04\/Algorithmes-de-rangement_fiche_eleve.pdf\" class=\"wp-block-file__button\" download>T\u00e9l\u00e9charger<\/a><\/div>\n\n\n\n<p>proposition correction algo rangement<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>objets=&#91;7,6,3,4,8,5,9,2]\ncartons=&#91;&#91;] for i in range(5)]\npds_max=11\n # je prends le premier objet dispo\n # je le range dans le premier carton dispo\n # je recommence jusqu'\u00e0 ne plus avoir d'objets\n \ndef rangement(objets):\n    '''\n    &gt;&gt;&gt;rangement(&#91;7,6,3,4,8,5,9,2])\n    &#91;&#91;7,3],&#91;6,4],&#91;8,2],&#91;5],&#91;9]]\n    '''\n    for objet in objets :\n        objet_range=False\n        for carton in cartons:\n            if objet_range==False:\n                if sum(carton)+objet&lt;=pds_max:\n                # j'ajoute l'objet \u00e0 mon carton\n                    carton.append(objet)\n                    objet_range=True\n    return cartons\n<\/code><\/pre>\n\n\n\n<p>Proposition de correction rendu monnaie<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>monnaie=&#91;1,2,5,10,20,50,100]\nmonnaie.reverse()\ndef rendu_monnaie(prix,somme):\n    '''\n    &gt;&gt;&gt;rendu_monnaie(21,30)\n    &#91;5,2,2]\n    &gt;&gt;&gt;rendu_monnaie(12,20)\n    &#91;5,2,1]\n    '''\n    # je calcule la somme a rendre\n    # je parcours la monnaie \u00e0 l'envers\n    # d\u00e8s que je trouve une valeur inf\u00e9rieure ou \u00e9gale\n    # \u00e0 la somme \u00e0 rendre\n    # je l'ajoute au rendu\n    # je l'enleve de la somme a rendre\n    # je recommence jusqu'\u00e0 ne plus avoir rien \u00e0 rendre\n    rendu=&#91;]\n    somme_a_rendre=somme-prix\n    while somme_a_rendre&gt;0:\n        on_continue=True\n        for piece in monnaie:\n            if on_continue==True:\n                if  piece&lt;=somme_a_rendre:\n                    rendu.append(piece)\n                    somme_a_rendre-=piece\n                    on_continue=False\n    return rendu\n    \n    \n<\/code><\/pre>\n\n\n\n<p>proposition correction<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>mes_objets=&#91;&#91;40,12],&#91;30,8],&#91;30,10],&#91;70,13]]\r\n\r\ndef rangement_sac_a_dos(max):\r\n    '''\r\n    >>>rangement_sac_a_dos(30)\r\n    &#91;&#91;70,13],&#91;40,12]]\r\n    '''\r\n    sac=&#91;]\r\n    poids_sac=0\r\n    objets=mes_objets.copy()\r\n............................    \r\n    # chercher l'objet avec la valeur max\r\n    # si je peux le mettre dans le sac\r\n    # je le mets, et je l'enleve des objets\r\n    # on recommence si possible\r\n    while ....................:\r\n        val_max=objets&#91;0]&#91;0]\r\n        for objet in objets:\r\n            if objet&#91;0]>val_max:\r\n                val_max=objet&#91;0]\r\n        if poids_sac+objet&#91;1]&lt;=max:\r\n            sac.append(objet)\r\n            objets.remove(objet)\r\n        else:\r\n           .....................\r\n    return sac\r\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Un algorithme est une suite finie et non ambigu\u00eb d&rsquo;instructions et d\u2019op\u00e9rations permettant de r\u00e9soudre&#8230;<\/p>\n<div class=\"more-link-wrapper\"><a class=\"more-link\" href=\"https:\/\/labodemaths.fr\/WordPress3\/nsi-algorithmes-gloutons-2\/\">Read the post<span class=\"screen-reader-text\">NSI : algorithmes gloutons<\/span><\/a><\/div>\n","protected":false},"author":2,"featured_media":1415,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[57],"tags":[],"_links":{"self":[{"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/posts\/1941"}],"collection":[{"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/comments?post=1941"}],"version-history":[{"count":17,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/posts\/1941\/revisions"}],"predecessor-version":[{"id":3124,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/posts\/1941\/revisions\/3124"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/media\/1415"}],"wp:attachment":[{"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/media?parent=1941"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/categories?post=1941"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/labodemaths.fr\/WordPress3\/wp-json\/wp\/v2\/tags?post=1941"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}