Algorithms and data structures
Big-O and running time
How running time and memory grow with input size, and how to argue about it.
About 6 hours of study.
Where to learn it
Read
Watch
Introduction to Algorithms (MIT 6.006, Spring 2020)
Erik Demaine, Jason Ku, Justin Solomon
Lecture 1 and Recitation 1
Section not checked yet
Practise
No practice set picked yet.
Suggest oneBefore and after
Learn first
Big-O and running time