{"id":7451,"date":"2022-04-28T20:53:35","date_gmt":"2022-04-28T20:53:35","guid":{"rendered":"https:\/\/www.tun.com\/courses\/2019\/12\/23\/divide-and-conquer-sorting-and-searching-and-randomized-algorithms\/"},"modified":"2022-04-28T20:53:36","modified_gmt":"2022-04-28T20:53:36","slug":"divide-and-conquer-sorting-and-searching-and-randomized-algorithms","status":"publish","type":"post","link":"https:\/\/www.tun.com\/courses\/divide-and-conquer-sorting-and-searching-and-randomized-algorithms\/stanford-university\/","title":{"rendered":"Divide and Conquer, Sorting and Searching, and Randomized Algorithms"},"content":{"rendered":"<div class=\"single_post\" style=\"margin-top:16px;\";>\n<div class=\"post-single-content box mark-links entry-content\">\n<div class=\"thecontent\">\n<h2>Description<\/h2>\n<p>The primary topics in this part of the specialization are: asymptotic (&#8220;Big-oh&#8221;) notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).<\/p>\n<div style=\"height:45px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n<h2 class=\"has-text-align-center\">Price: Enroll For Free!<\/h2>\n<div style=\"height:45px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n<div class=\"wp-block-button aligncenter\"><a class=\"wp-block-button__link has-text-color has-very-light-gray-color has-background has-vivid-red-background-color\" href=\"https:\/\/www.coursera.org\/learn\/algorithms-divide-conquer\">View Class<\/a><\/div>\n<div style=\"height:55px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n<div class=\"wp-block-columns\">\n<div class=\"wp-block-column\">\n<p class=\"has-text-align-center\"><em><strong>Language:<\/strong> <\/em>English<\/p>\n<\/div>\n<div class=\"wp-block-column\">\n<p class=\"has-text-align-center\"><em><strong>Subtitles<\/strong>: <\/em>English<\/p>\n<\/div>\n<\/div>\n<p style=\"background-color:#496d89\" class=\"has-text-color has-background has-text-align-center has-very-light-gray-color\"><a href=\"https:\/\/www.coursera.org\/learn\/algorithms-divide-conquer\">Divide and Conquer, Sorting and Searching, and Randomized Algorithms<strong> &#8211; Stanford University<\/strong><\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Description The primary topics in this part of the specialization are: asymptotic (&#8220;Big-oh&#8221;) notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts). Price: Enroll For Free! View Class Language: English Subtitles: English Divide and Conquer, Sorting and Searching, and Randomized [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":19437,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_uag_custom_page_level_css":"","_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_uf_show_specific_survey":0,"_uf_disable_surveys":false,"footnotes":""},"categories":[211],"tags":[],"class_list":["post-7451","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-stanford-university"],"aioseo_notices":[],"uagb_featured_image_src":{"full":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/Stanford-Universityonline-education.png",379,223,false],"thumbnail":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/Stanford-Universityonline-education-150x150.png",150,150,true],"medium":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/Stanford-Universityonline-education-300x177.png",300,177,true],"medium_large":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/Stanford-Universityonline-education.png",379,223,false],"large":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/Stanford-Universityonline-education.png",379,223,false],"1536x1536":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/Stanford-Universityonline-education.png",379,223,false],"2048x2048":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/Stanford-Universityonline-education.png",379,223,false]},"uagb_author_info":{"display_name":"Axiom Pegasus","author_link":"https:\/\/www.tun.com\/courses\/author\/magic\/"},"uagb_comment_info":0,"uagb_excerpt":"Description The primary topics in this part of the specialization are: asymptotic (&#8220;Big-oh&#8221;) notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts). Price: Enroll For Free! View Class Language: English Subtitles: English Divide and Conquer, Sorting and Searching, and Randomized&hellip;","featured_media_src_url":"https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/Stanford-Universityonline-education.png","_links":{"self":[{"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/posts\/7451","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/comments?post=7451"}],"version-history":[{"count":0,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/posts\/7451\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/media\/19437"}],"wp:attachment":[{"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/media?parent=7451"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/categories?post=7451"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/tags?post=7451"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}