- This event has passed.
7:15 PM – Intro To Competitive Programming – Gamas
December 2, 2023 @ 7:15 pm - 8:15 pm
Today We Did
- We went over binary search and explain why the big O notation is O log(n).
- We went over linear search.
- We went over brute force (complete search) algorithm
Homework
- Do the Milk Pails problem from here.
- Since USACO qualification is December 15, do your exercises from problems listed in https://usaco.guide/bronze/ . No pain no gain.
