BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//American Young Coder - ECPv6.10.1.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.ayclogic.com
X-WR-CALDESC:Events for American Young Coder
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250715T190000
DTEND;TZID=America/Los_Angeles:20250715T200000
DTSTAMP:20260430T062901
CREATED:20250716T010633Z
LAST-MODIFIED:20250716T010633Z
UID:29722-1752606000-1752609600@www.ayclogic.com
SUMMARY:7 PM – Intro to Competitive Programming – Darin
DESCRIPTION:What We Did Today:\n\nReviewed Recursion\nImplemented the Fibonacci Function using Recursion\nLearnt about Memoization\n\nHomework:\nSubmit into the google drive here when you are finished! \n\n// new HW\n// create a recursive function binSearch(n\, low\, high) that looks for the number n in a sorted list\n\n// This is called the binary search algorithm\n\n// binSearch(5) = true\n// binSearch(1) = false\n// 0 2 3 4 5 6 7 8\n\n// see if n is equal to len(list) / 2\n// if it is greater than len(list) / 2: traverse the upper half\n// else traverse the lower half\n\n// base case\n// operation\n// recursive function\n\n// output: true or false\n\nhint: use low and high as variables to determine which part of the array to look around\nAlso watch these two videos: \nDynamic Programming: https://www.youtube.com/watch?v=oNoILrFOx2k \nGreedy Algorithms: https://www.youtube.com/watch?v=lfQvPHGtu6Q \n\nNotes:\nYou can reach out to me at ddjapri@ayclogic.com if you have any questions! \nYou can find class notes here.
URL:https://www.ayclogic.com/event/7-pm-intro-to-competitive-programming-darin-14/
CATEGORIES:Intro To Competitive,Java
END:VEVENT
END:VCALENDAR