: The course introduces Big-O notation, teaching students how to quantify the efficiency of code, especially recursive functions. Course Structure and Philosophy
I tried to derive you from the first principles. I thought you were a base case, Something simple I could hold, But you were an inductive step— A recursive function calling itself, Changing every time I thought I had the answer. : The course introduces Big-O notation, teaching students
: Students learn the fundamentals of predicate logic and how to write clear, literate proofs using techniques like direct proof, contrapositive, and contradiction. : The course introduces Big-O notation
: These form the language of the course, defining how data can be grouped, mapped, and compared. Something simple I could hold