{"id":1418,"date":"2014-05-19T22:42:28","date_gmt":"2014-05-20T02:42:28","guid":{"rendered":"http:\/\/ktomdesign.com\/blog\/?p=1418"},"modified":"2017-09-24T15:43:19","modified_gmt":"2017-09-24T19:43:19","slug":"15-sorting-algorithms-vizualized","status":"publish","type":"post","link":"http:\/\/ktomdesign.com\/blog\/2014\/05\/15-sorting-algorithms-vizualized\/","title":{"rendered":"15 Sorting Algorithms Vizualized"},"content":{"rendered":"<p>Timo Bingmann has created a visualization of various sorting algorithms. At the end of each segment, the different bars are arranged in a smallest&#8211;&gt; largest order.<\/p>\n<p>Until watching this video I wasn&#8217;t really aware that there were different methods that computers used for sorting numbers, but I guess it would make sense!<\/p>\n<p><iframe loading=\"lazy\" width=\"500\" height=\"281\" src=\"https:\/\/www.youtube.com\/embed\/kPRA0W1kECg?feature=oembed\" frameborder=\"0\" allowfullscreen><\/iframe><\/p>\n<p>A quick Google search has revealed a <a href=\"http:\/\/faculty.simpson.edu\/lydia.sinapova\/www\/cmsc250\/LN250_Weiss\/L18-SummarySortAlg.htm\" target=\"_blank\" rel=\"noopener noreferrer\">30,000 ft. view of algorithms<\/a> from\u00a0<span style=\"color: #000000;\">\u00a0<\/span>Lydia Sinapova. If you&#8217;re so inclined, you can also check out the <a href=\"http:\/\/en.wikipedia.org\/wiki\/Sorting_algorithm\" target=\"_blank\" rel=\"noopener noreferrer\">Wikipedia page<\/a>.<\/p>\n<p>The algorithms in the video are:<\/p>\n<table style=\"width: 600px;\">\n<tbody>\n<tr>\n<td width=\"50%\">\n<ul>\n<li>selection sort<\/li>\n<li>insertion sort<\/li>\n<li>quick sort<\/li>\n<li>merge sort<\/li>\n<li>heap sort<\/li>\n<li>radix sort (LSD)<\/li>\n<li>radix sort (MSD)<\/li>\n<li>std::sort (intro sort)<\/li>\n<\/ul>\n<\/td>\n<td>\n<ul>\n<li>std::stable_sort (adaptive merge sort)<\/li>\n<li>shell sort<\/li>\n<li>bubble sort<\/li>\n<li>cocktail shaker sort<\/li>\n<li>gnome sort<\/li>\n<li>bitonic sort<\/li>\n<li>bogo sort (30 seconds)<\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>via <a href=\"https:\/\/www.facebook.com\/amy.e.kidd\/posts\/10152213137263621\" target=\"_blank\" rel=\"noopener noreferrer\">Amy Kidd<\/a>\u00a0via <a href=\"http:\/\/digg.com\/video\/15-sorting-algorithms-in-6-minutes\" target=\"_blank\" rel=\"noopener noreferrer\">Digg<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Timo Bingmann has created a visualization of various sorting algorithms. At the end of each segment, the different bars are arranged in a smallest&#8211;&gt; largest order. Until watching this video I wasn&#8217;t really aware that there were different methods that computers used for sorting numbers, but I guess it would make sense! A quick Google [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[5],"tags":[146,75],"_links":{"self":[{"href":"http:\/\/ktomdesign.com\/blog\/wp-json\/wp\/v2\/posts\/1418"}],"collection":[{"href":"http:\/\/ktomdesign.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/ktomdesign.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/ktomdesign.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/ktomdesign.com\/blog\/wp-json\/wp\/v2\/comments?post=1418"}],"version-history":[{"count":9,"href":"http:\/\/ktomdesign.com\/blog\/wp-json\/wp\/v2\/posts\/1418\/revisions"}],"predecessor-version":[{"id":1436,"href":"http:\/\/ktomdesign.com\/blog\/wp-json\/wp\/v2\/posts\/1418\/revisions\/1436"}],"wp:attachment":[{"href":"http:\/\/ktomdesign.com\/blog\/wp-json\/wp\/v2\/media?parent=1418"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/ktomdesign.com\/blog\/wp-json\/wp\/v2\/categories?post=1418"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/ktomdesign.com\/blog\/wp-json\/wp\/v2\/tags?post=1418"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}