{"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\/de\/2022\/07\/09\/cocktail-shaker-sort\/","title":{"rendered":"Cocktail-Shaker-Sorte"},"content":{"rendered":"

Cocktail-Shaker-Sortierung – Sch\u00fcttlersortierung, eine Variante der bidirektionalen Blasensortierung.
Der Algorithmus funktioniert wie folgt:<\/p>\n

    \n
  1. Die anf\u00e4ngliche Suchrichtung in der Schleife wird ausgew\u00e4hlt (normalerweise von links nach rechts)<\/li>\n
  2. Als n\u00e4chstes werden in der Schleife die Zahlen paarweise \u00fcberpr\u00fcft<\/li>\n
  3. Wenn das n\u00e4chste Element gr\u00f6\u00dfer ist, werden sie vertauscht<\/li>\n
  4. Wenn der Suchvorgang abgeschlossen ist, beginnt er erneut mit umgekehrter Richtung<\/li>\n
  5. Die Suche wird wiederholt, bis keine Permutationen mehr vorhanden sind<\/li>\n<\/ol>\n

    Die zeitliche Komplexit\u00e4t des Algorithmus ist \u00e4hnlich wie bei einer Blase – O(n2<\/sup>)<\/span><\/span>.<\/p>\n

    Beispiel f\u00fcr die Implementierung in PHP:<\/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":"
    Cocktail-Shaker-Sortierung – Sch\u00fcttlersortierung, eine Variante der bidirektionalen Blasensortierung.Der Algorithmus funktioniert wie folgt: Die anf\u00e4ngliche Suchrichtung in der Schleife wird ausgew\u00e4hlt (normalerweise von links nach rechts) Als n\u00e4chstes werden in der Schleife die Zahlen paarweise \u00fcberpr\u00fcft Wenn das n\u00e4chste Element gr\u00f6\u00dfer ist, werden sie vertauscht Wenn der Suchvorgang abgeschlossen ist, beginnt er erneut mit umgekehrter RichtungContinue reading “Cocktail-Shaker-Sorte”<\/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":"de","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\/de\/wp-json\/wp\/v2\/posts\/3263","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/demensdeum.com\/blog\/de\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/demensdeum.com\/blog\/de\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/de\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/de\/wp-json\/wp\/v2\/comments?post=3263"}],"version-history":[{"count":30,"href":"https:\/\/demensdeum.com\/blog\/de\/wp-json\/wp\/v2\/posts\/3263\/revisions"}],"predecessor-version":[{"id":3874,"href":"https:\/\/demensdeum.com\/blog\/de\/wp-json\/wp\/v2\/posts\/3263\/revisions\/3874"}],"wp:attachment":[{"href":"https:\/\/demensdeum.com\/blog\/de\/wp-json\/wp\/v2\/media?parent=3263"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/de\/wp-json\/wp\/v2\/categories?post=3263"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/de\/wp-json\/wp\/v2\/tags?post=3263"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}