{"id":3263,"date":"2022-07-09T14:51:13","date_gmt":"2022-07-09T11:51:13","guid":{"rendered":"https:\/\/demensdeum.com\/blog\/?p=3263"},"modified":"2024-12-16T22:32:18","modified_gmt":"2024-12-16T19:32:18","slug":"cocktail-shaker-sort","status":"publish","type":"post","link":"https:\/\/demensdeum.com\/blog\/fr\/2022\/07\/09\/cocktail-shaker-sort\/","title":{"rendered":"Trier par shaker \u00e0 cocktail"},"content":{"rendered":"

Tri au shaker \u00e0 cocktail\u00a0&#8211\u00a0; le tri shaker, une variante du tri bidirectionnel \u00e0 bulles.
L’algorithme fonctionne comme suit\u00a0:<\/p>\n

    \n
  1. La direction initiale de la recherche dans la boucle est s\u00e9lectionn\u00e9e (g\u00e9n\u00e9ralement de gauche \u00e0 droite)<\/li>\n
  2. Ensuite dans la boucle, les nombres sont v\u00e9rifi\u00e9s par paires<\/li>\n
  3. Si l’\u00e9l\u00e9ment suivant est plus grand, alors ils sont \u00e9chang\u00e9s<\/li>\n
  4. Une fois termin\u00e9, le processus de recherche recommence avec le sens invers\u00e9<\/li>\n
  5. La recherche est r\u00e9p\u00e9t\u00e9e jusqu’\u00e0 ce qu’il n’y ait plus de permutations<\/li>\n<\/ol>\n

    La complexit\u00e9 temporelle de l’algorithme est similaire \u00e0 celle d’une bulle\u00a0; O(n2<\/sup>)<\/span><\/span>.<\/p>\n

    Exemple d’impl\u00e9mentation en PHP\u00a0:<\/p>\n

    \n
    \n
    <?php\n\nfunction cocktailShakeSort($numbers)\n{\n    echo implode(\",\", $numbers),\"\\n\";\n    $direction = false;\n    $sorted = false;\n    do {\n        $direction = !$direction;        \n        $firstIndex = $direction == true ? 0 : count($numbers) - 1;\n        $lastIndex = $direction == true ? count($numbers) - 1 : 0;\n        \n        $sorted = true;\n        for (\n            $i = $firstIndex;\n            $direction == true ? $i < $lastIndex : $i > $lastIndex;\n            $direction == true ? $i++ : $i--\n        ) {\n            $lhsIndex = $direction ? $i : $i - 1;\n            $rhsIndex = $direction ? $i + 1 : $i;\n\n            $lhs = $numbers[$lhsIndex];\n            $rhs = $numbers[$rhsIndex];\n\n            if ($lhs > $rhs) {\n                $numbers[$lhsIndex] = $rhs;\n                $numbers[$rhsIndex] = $lhs;\n                $sorted = false;\n            }\n        }\n    } while ($sorted == false);\n\n    echo implode(\",\", $numbers);\n}\n\n$numbers = [2, 1, 4, 3, 69, 35, 55, 7, 7, 2, 6, 203, 9];\ncocktailShakeSort($numbers);\n\n?><\/code><\/pre>\n<\/div>\n
    \u0421\u0441\u044b\u043b\u043a\u0438<\/h3>\n
    https:\/\/gitlab.com\/demensdeum\/algorithms\/-\/blob\/master\/sortAlgorithms\/cocktailShakerSort\/cocktailShakerSort.php<\/a><\/p>\n
    \u0418\u0441\u0442\u043e\u0447\u043d\u0438\u043a\u0438<\/h3>\n
    https:\/\/www.youtube.com\/watch?v=njClLBoEbfI<\/a>
    \n    https:\/\/www.geeksforgeeks.org\/cocktail-sort\/<\/a>
    \n    https:\/\/rosettacode.org\/wiki\/Sorting_algorithms\/Cocktail_sort<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"
    Tri au shaker \u00e0 cocktail\u00a0&#8211\u00a0; le tri shaker, une variante du tri bidirectionnel \u00e0 bulles.L’algorithme fonctionne comme suit\u00a0: La direction initiale de la recherche dans la boucle est s\u00e9lectionn\u00e9e (g\u00e9n\u00e9ralement de gauche \u00e0 droite) Ensuite dans la boucle, les nombres sont v\u00e9rifi\u00e9s par paires Si l’\u00e9l\u00e9ment suivant est plus grand, alors ils sont \u00e9chang\u00e9s UneContinue reading “Trier par shaker \u00e0 cocktail”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[61,52],"tags":[131,195,190],"class_list":["post-3263","post","type-post","status-publish","format-standard","hentry","category-techie","category-tutorials","tag-algorithms","tag-cocktail-shaker-sort","tag-sorting","entry"],"translation":{"provider":"WPGlobus","version":"3.0.2","language":"fr","enabled_languages":["en","ru","zh","de","fr","ja","pt"],"languages":{"en":{"title":true,"content":true,"excerpt":false},"ru":{"title":true,"content":true,"excerpt":false},"zh":{"title":true,"content":true,"excerpt":false},"de":{"title":true,"content":true,"excerpt":false},"fr":{"title":true,"content":true,"excerpt":false},"ja":{"title":true,"content":true,"excerpt":false},"pt":{"title":true,"content":true,"excerpt":false}}},"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/posts\/3263","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/comments?post=3263"}],"version-history":[{"count":30,"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/posts\/3263\/revisions"}],"predecessor-version":[{"id":3874,"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/posts\/3263\/revisions\/3874"}],"wp:attachment":[{"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/media?parent=3263"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/categories?post=3263"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/tags?post=3263"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}