{"id":1289,"date":"2013-09-21T16:55:01","date_gmt":"2013-09-21T20:55:01","guid":{"rendered":"http:\/\/blog.carlrobitaille.org\/2013\/09\/21\/videotitle-5\/"},"modified":"2018-11-05T21:53:21","modified_gmt":"2018-11-06T02:53:21","slug":"15-sorting-algorithms-in-6-minutes","status":"publish","type":"post","link":"https:\/\/blog.carlrobitaille.org\/?p=1289","title":{"rendered":"15 Sorting Algorithms in 6 Minutes"},"content":{"rendered":"<p>De la description sur youtube:<br \/>&quot;Visualization and &quot;audibilization&quot; of 15 Sorting Algorithms in 6 Minutes.<br \/>Sorts random shuffles of integers, with both speed and the number of items adapted to each algorithm&#8217;s complexity.<br \/>The algorithms are: selection sort, insertion sort, quick sort, merge sort, heap sort, radix sort (LSD), radix sort (MSD), std::sort (intro sort), std::stable_sort (adaptive merge sort), shell sort, bubble sort, cocktail shaker sort, gnome sort, bitonic sort and bogo sort (30 seconds of it).&quot;<\/p>\n<p><b>Google+ reshared post<\/b><\/p>\n<blockquote><p><b>NERD ALERT<\/b><\/p>\n<p>Get your nerd on!<\/p>\n<p>This is awesome! Fun to watch even if you don&#8217;t know wtf is going on.<\/p><\/blockquote>\n<p><iframe loading=\"lazy\" title=\"15 Sorting Algorithms in 6 Minutes\" width=\"584\" height=\"329\" src=\"https:\/\/www.youtube.com\/embed\/kPRA0W1kECg?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" referrerpolicy=\"strict-origin-when-cross-origin\" allowfullscreen><\/iframe><\/p>\n<p>Import\u00e9 de <a href=\"https:\/\/plus.google.com\/104239776541827516598\/posts\/bxPd1NmWJfp\">Google+<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>De la description sur youtube:&quot;Visualization and &quot;audibilization&quot; of 15 Sorting Algorithms in 6 Minutes.Sorts random shuffles of integers, with both speed and the number of items adapted to each algorithm&#8217;s complexity.The algorithms are: selection sort, insertion sort, quick sort, merge &hellip; <a href=\"https:\/\/blog.carlrobitaille.org\/?p=1289\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[14,15],"tags":[],"class_list":["post-1289","post","type-post","status-publish","format-standard","hentry","category-informatique","category-programmation"],"_links":{"self":[{"href":"https:\/\/blog.carlrobitaille.org\/index.php?rest_route=\/wp\/v2\/posts\/1289","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.carlrobitaille.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.carlrobitaille.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.carlrobitaille.org\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.carlrobitaille.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1289"}],"version-history":[{"count":1,"href":"https:\/\/blog.carlrobitaille.org\/index.php?rest_route=\/wp\/v2\/posts\/1289\/revisions"}],"predecessor-version":[{"id":1299,"href":"https:\/\/blog.carlrobitaille.org\/index.php?rest_route=\/wp\/v2\/posts\/1289\/revisions\/1299"}],"wp:attachment":[{"href":"https:\/\/blog.carlrobitaille.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1289"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.carlrobitaille.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1289"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.carlrobitaille.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1289"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}