{"id":1518,"date":"2015-05-31T19:26:09","date_gmt":"2015-06-01T02:26:09","guid":{"rendered":"http:\/\/sites.evergreen.edu\/compcog15\/?page_id=1518"},"modified":"2017-05-31T12:17:57","modified_gmt":"2017-05-31T19:17:57","slug":"june-3","status":"publish","type":"page","link":"https:\/\/sites.evergreen.edu\/compcog17\/june-3\/","title":{"rendered":"May 31"},"content":{"rendered":"<h1>Review\/ BST<\/h1>\n<h1>In the News<\/h1>\n<h1>Grades:<br \/>\n&#8212; Competencies<br \/>\n&#8212; TTT, MM, Extra<br \/>\n&#8212; Content Exam<br \/>\n&#8212; Seminars<br \/>\n&#8212; Presentations<br \/>\n&#8212; Assignments<br \/>\n&#8212; Participation\/Helping<\/h1>\n<h1>What is Recursion and Why is it Useful?<br \/>\n&#8212;-<a href=\"https:\/\/myfiles.evergreen.edu\/academics\/programs\/compcog-s17\/Handouts\/Fibbo.html\">Fibbo<\/a>, \u00a0<a href=\"https:\/\/myfiles.evergreen.edu\/academics\/programs\/compcog-s17\/Handouts\/Factorial.html\">Factorial<\/a>, <a href=\"https:\/\/myfiles.evergreen.edu\/academics\/programs\/compcog-s17\/Handouts\/FibboMult.html\">\u00a0FibboMult<\/a><\/h1>\n<h1>Socco #- \u00a0S(n) = S(n-1) * S(n-2) + S(n-3)<\/h1>\n<h1><a href=\"https:\/\/www.youtube.com\/watch?v=tWEV4AGuVis\">Recursive Video<\/a>\u00a0 <a href=\"https:\/\/www.khanacademy.org\/math\/calculus-home\/series-calc\/sequences-calc\/v\/term-of-recursive-sequence\">#2<\/a><\/h1>\n<h1>BST and Recursion<br \/>\n&#8212;\u00a0\u00a0<a href=\"https:\/\/myfiles.evergreen.edu\/academics\/programs\/compcog-s17\/Handouts\/BSTRndNamesSort.html\"> Sort<\/a><\/h1>\n<h1>More Recursion: Heaps, Trees<\/h1>\n<h1>Pre-Seminar<\/h1>\n<h1>Seminar<\/h1>\n<h1>Brain Presentations<\/h1>\n<h1>Computer Science: \u00a0Computer Jobs<\/h1>\n<h1>To Do<\/h1>\n<h1>Competency Exam<\/h1>\n<h1>Work Time<\/h1>\n<h1><\/h1>\n","protected":false},"excerpt":{"rendered":"<p>Review\/ BST In the News Grades: &#8212; Competencies &#8212; TTT, MM, Extra &#8212; Content Exam &#8212; Seminars &#8212; Presentations &#8212; Assignments &#8212; Participation\/Helping What is Recursion and Why is it Useful? &#8212;-Fibbo, \u00a0Factorial, \u00a0FibboMult Socco #- \u00a0S(n) = S(n-1) * S(n-2) + S(n-3) Recursive Video\u00a0 #2 BST and Recursion &#8212;\u00a0\u00a0 Sort More Recursion: Heaps, Trees [&hellip;]<\/p>\n","protected":false},"author":274,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","meta":{"_mi_skip_tracking":false},"_links":{"self":[{"href":"https:\/\/sites.evergreen.edu\/compcog17\/wp-json\/wp\/v2\/pages\/1518"}],"collection":[{"href":"https:\/\/sites.evergreen.edu\/compcog17\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.evergreen.edu\/compcog17\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.evergreen.edu\/compcog17\/wp-json\/wp\/v2\/users\/274"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.evergreen.edu\/compcog17\/wp-json\/wp\/v2\/comments?post=1518"}],"version-history":[{"count":0,"href":"https:\/\/sites.evergreen.edu\/compcog17\/wp-json\/wp\/v2\/pages\/1518\/revisions"}],"wp:attachment":[{"href":"https:\/\/sites.evergreen.edu\/compcog17\/wp-json\/wp\/v2\/media?parent=1518"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}