Analysing (A)

If you enjoy solving complex problems and understanding the limits of computation, Complexity and Tractability is an excellent choice. You'll explore how to measure problem difficulty, develop efficient algorithms, and tackle challenges that seem impossible at first glance. 

https://www.csfieldguide.org.nz/en/chapters/complexity-and-tractability/

Big O notation

https://medium.com/@yuribett/confused-by-big-o-notation-a-newbies-guide-to-understand-it-once-and-for-all-23aff8b84d60#:~:text=Big%20O%20notation%20is%20a,grows%20as%20the%20size%20of

Polynomial Time

https://www.khanacademy.org/computing/ap-computer-science-principles/algorithms-101/evaluating-algorithms/a/comparing-run-time-efficiency

Solving Hard problems

https://www.khanacademy.org/computing/ap-computer-science-principles/algorithms-101/solving-hard-problems/a/using-heuristics

YouTube playlist.

Here is the google slide show seen in the playlist. 

The support files that some have used are at the preceding link.

Clicking on the links below *should* allow people to make copies of the quizzes (maybe, assuming I have not messed up the permissions).

Complexity & Time Quiz

Minimal Spanning Trees  (Diagrams are in the support files folder above)

TSP Heuristics (review)

Here is the folder which has the quizzes / notes that we're using.  The plan is to add to it as we continue to work through this topic.