{"id":40,"date":"2015-08-18T14:14:34","date_gmt":"2015-08-18T18:14:34","guid":{"rendered":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/?page_id=40"},"modified":"2015-09-28T13:40:28","modified_gmt":"2015-09-28T17:40:28","slug":"useful-links-animations-etc","status":"publish","type":"page","link":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/useful-links-animations-etc\/","title":{"rendered":"Useful Links, Animations, etc"},"content":{"rendered":"<ul>\n<li><a href=\"http:\/\/ocw.mit.edu\/OcwWeb\/Electrical-Engineering-and-Computer-Science\/6-046JFall-2005\/CourseHome\/index.htm\">MIT open courseware<\/a><\/li>\n<li>Jeff Erickson&#8217;s algorithms <a href=\"http:\/\/jeffe.cs.illinois.edu\/teaching\/algorithms\/\">lecture notes<\/a><\/li>\n<li>Algortithms textbook by Dasgupta, Papadimitriou and Vazirani\u00a0<a href=\"http:\/\/www.beust.com\/algorithms.pdf\">online<\/a><\/li>\n<li>Sorting animations:\u00a0<a href=\"http:\/\/www.sorting-algorithms.com\/\">all sorts<\/a>\u00a0|\u00a0<a href=\"http:\/\/www.cs.bell-labs.com\/cm\/cs\/pearls\/sortanim.html\">Progr.pearls<\/a>\u00a0| <a href=\"http:\/\/www.cs.princeton.edu\/courses\/archive\/fall12\/cos226\/demo\/21DemoSelectionSort.mov\">selection sort <\/a>|<a href=\"http:\/\/www.cs.princeton.edu\/courses\/archive\/fall12\/cos226\/demo\/21DemoInsertionSort.mov\"> insertion sort<\/a><\/li>\n<li><a href=\"http:\/\/plato.stanford.edu\/entries\/paradox-zeno\/#3\">Zeno&#8217;s paradoxes<\/a><\/li>\n<li>Mathematical induction:\n<ul>\n<li><a href=\"http:\/\/www.stanford.edu\/class\/cs103a\/handouts\/42%20Mathematical%20Induction.pdf\">Mathematical induction<\/a>\u00a0(Robert Plummer, Stanford)<\/li>\n<li><a href=\"http:\/\/www.cs.cmu.edu\/~adamchik\/21-127\/lectures\/induction_1_print.pdf\">Mathematical induction<\/a>\u00a0(V. Adamchik, CMU)<\/li>\n<li><a href=\"http:\/\/www.math.utah.edu\/mathcircle\/notes\/induction.pdf\">Mathematical induction<\/a>(Tom Davis, Utah)<\/li>\n<li><a href=\"http:\/\/www.themathpage.com\/aprecalc\/mathematical-induction.htm\">Mathematical induction<\/a>\u00a0(TheMathPage)<\/li>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=NYmxvDbjPak\">Induction<\/a>(YouTube)<\/li>\n<\/ul>\n<\/li>\n<li><a href=\"http:\/\/www.cs.princeton.edu\/courses\/archive\/fall06\/cos226\/demo\/merge\/\">Mergesort<\/a>\u00a0(Princeton)<\/li>\n<li><a href=\"http:\/\/www.cs.princeton.edu\/courses\/archive\/fall12\/cos226\/demo\/24DemoBinaryHeap.mov\">Heaps<\/a> | <a href=\"http:\/\/www.cs.princeton.edu\/courses\/archive\/fall12\/cos226\/demo\/24DemoHeapsort.mov\">Heapsort<\/a> (from K Wayne, Princeton)<\/li>\n<li>Quicksort: Hoare&#8217;s partition\u00a0<a href=\"http:\/\/www.cs.princeton.edu\/courses\/archive\/fall06\/cos226\/demo\/demo-partition.ppt\">demo<\/a>\u00a0(from Sedgewick and Wayne, Princeton) \u00a0| <a href=\"http:\/\/www.cs.princeton.edu\/courses\/archive\/fall12\/cos226\/demo\/23DemoPartitioningDijkstra.pdf\">3-way <\/a>partition (Princeton) | <a href=\"http:\/\/www.cs.princeton.edu\/courses\/archive\/fall12\/cos226\/demo\/23DemoPartitioningDualPivot.pdf\">dual-pivot<\/a> partition (Princeton)<\/li>\n<li><a href=\"http:\/\/www.cs.princeton.edu\/courses\/archive\/spring05\/cos423\/lectures\/05divide-and-conquer.pdf\">Divide-and-conquer<\/a>\u00a0(Princeton) |\u00a0<a href=\"http:\/\/www.cs.princeton.edu\/~wayne\/teaching\/multiply.pdf\">Matrix multiplication<\/a>\u00a0(Princeton)<\/li>\n<li><a href=\"http:\/\/www.cs.princeton.edu\/courses\/archive\/fall07\/cos226\/demo\/graph\/Graph.html\">Graph vizualizations<\/a>\u00a0(Princeton)|\u00a0<a href=\"http:\/\/www.cs.cmu.edu\/~scandal\/applets\/concomp.html\">CC<\/a>\u00a0|\u00a0<a href=\"http:\/\/sziami.cs.bme.hu\/~gsala\/alg_anims\/3\/graph2-e.html\">BFS<\/a>\u00a0|\u00a0<a href=\"http:\/\/www.cs.sunysb.edu\/~skiena\/combinatorica\/animations\/search.html\">DFS<\/a><\/li>\n<li><a href=\"http:\/\/www.cs.sunysb.edu\/~skiena\/combinatorica\/animations\/dijkstra.html\">Dijkstra\/MST animation<\/a>\u00a0| another Dijkstra\u00a0<a href=\"http:\/\/www.unf.edu\/~wkloster\/foundations\/DijkstraApplet\/DijkstraApplet.htm\">animation<\/a>\u00a0|\u00a0<a href=\"http:\/\/www.bowdoin.edu\/~ltoma\/teaching\/cs231\/spring15\/Material\/demo-dijkstra.pdf\">Slides<\/a>\u00a0(Princeton) |\u00a0\u00a0<a href=\"http:\/\/www.bowdoin.edu\/~ltoma\/teaching\/cs231\/spring15\/Material\/UnionFind.pdf\">UnionFind<\/a>\u00a0(Princeton)<\/li>\n<li>Fun read:\u00a0<a href=\"http:\/\/www.bowdoin.edu\/~ltoma\/teaching\/cs231\/spring15\/Material\/broder86pessimal.pdf\">Pessimal algorithms<\/a>\u00a0(Broder, Stolfi)<\/li>\n<li>Complexity\n<ul>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=a3ww0gwEszo\">Longest path<\/a><\/li>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=moPtwq_cVH8\">Complexity<\/a>\u00a0(lecture by E. Demaine)<\/li>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=msp2y_Y5MLE\">P vs NP problem<\/a>(Lecture by M. Sipser, Clay Institute, hosted at Harvard 2006)<\/li>\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=VqeF98GGiXQ\">P=NP<\/a>(Erik Demaine proves P=NP)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>Other undergraduate algorithm classes on the web:<\/p>\n<ul>\n<li>Swarthmore:\u00a0<a href=\"http:\/\/www.cs.swarthmore.edu\/~adanner\/cs41\/f12\/\">cs41-fall12<\/a>\u00a0(Danner, KT)<\/li>\n<li>Williams:\u00a0<a href=\"http:\/\/dept.cs.williams.edu\/~heeringa\/classes\/cs256\/s13\/\">cs256-spring2013<\/a>\u00a0(Heeringa, KT) &lt;&#8212;- check out the grading scheme!<\/li>\n<li>Carleton:\u00a0<a href=\"http:\/\/cs.carleton.edu\/faculty\/jadrian\/cs252\/2014.0\/index.html\">cs252-W14<\/a>\u00a0(Miles, KT) |\u00a0\u00a0<a href=\"http:\/\/dept.cs.williams.edu\/~heeringa\/classes\/cs256\/s13\/\">cs252-w13<\/a>\u00a0(Liben-Nowell, KT) &lt;&#8212;- check out the &#8220;who to ask for help&#8221; section!<\/li>\n<li>Wellesley:\u00a0<a href=\"http:\/\/cs.wellesley.edu\/~cs231\/\">CS231-fall 2014<\/a>\u00a0(Metaxas, CLRS)<\/li>\n<li>MIT Open CourseWare:\u00a0<a href=\"http:\/\/ocw.mit.edu\/courses\/electrical-engineering-and-computer-science\/6-046j-introduction-to-algorithms-sma-5503-fall-2005\/\">Algorithms<\/a>\u00a0(CLRS) |\u00a0\u00a0<a href=\"http:\/\/theory.lcs.mit.edu\/classes\/6.046\/fall02\">Fall 2002<\/a>\u00a0(Demaine, Goldwasser)<\/li>\n<li>Stanford:\u00a0<a href=\"http:\/\/www.stanford.edu\/class\/cs161\/\">Fall 2014<\/a>\u00a0(Plotkin, CLRS) &lt;&#8212;check out the &#8220;Why study algorithms&#8221; in the intro slides.<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>MIT open courseware Jeff Erickson&#8217;s algorithms lecture notes Algortithms textbook by Dasgupta, Papadimitriou and Vazirani\u00a0online Sorting animations:\u00a0all sorts\u00a0|\u00a0Progr.pearls\u00a0| selection sort | insertion sort Zeno&#8217;s paradoxes Mathematical induction: Mathematical induction\u00a0(Robert Plummer, Stanford) Mathematical induction\u00a0(V. Adamchik, CMU) Mathematical induction(Tom Davis, Utah) Mathematical induction\u00a0(TheMathPage) Induction(YouTube) Mergesort\u00a0(Princeton) Heaps | Heapsort (from K Wayne, Princeton) Quicksort: Hoare&#8217;s partition\u00a0demo\u00a0(from Sedgewick and [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-40","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/wp-json\/wp\/v2\/pages\/40","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/wp-json\/wp\/v2\/comments?post=40"}],"version-history":[{"count":0,"href":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/wp-json\/wp\/v2\/pages\/40\/revisions"}],"wp:attachment":[{"href":"https:\/\/courses.bowdoin.edu\/computer-science-2200\/wp-json\/wp\/v2\/media?parent=40"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}