Prepare your lesson on complexity #4

Link to the coursework

https://sdc.codeyourfuture.io/complexity/prep/

Learning Objectives

• Put together a presentation on a topic you explored in prep

Why are we doing this?

By teaching we learn. The best way to really understand a subject well is to know it well enough to teach another.

In class this week you will be teaching something. You will be explaining one of the following computer science concepts. You will not use a computer to explain this, but something else. This could be a whiteboard presentation, a drawing, a game, a conversation, or anything you like that will help you communicate the concept, except a computer!

Topics (for both sprints)

1. Caching
2. Precomputing
3. Memoisation
4. Time complexity of either logarithmic, linear, quadratic, or exponential algorithms
5. Any sorting algorithm that takes your fancy
6. Any search strategy

Maximum time in hours

4

How to get help

Come to Friday demos to practice your lesson. Ask trainees in the ITP course to give you feedback.

How to submit

Give your demo in class.

How to review

No response

Anything else?

• https://fs.blog/feynman-technique/
• https://www.csunplugged.org/en/topics/
• https://visualgo.net/en/sorting
• https://programiz.pro/course/dsa-complexity-calculation