Every private note you have written, searchable in one place. Lecturers and administrators cannot see these.
Data Structures and Algorithms · Big-O, big-Theta and big-Omega · 25 Aug 2026
Rule of thumb: count innermost statement executions as a function of n, drop constants and lower-order terms.
Open the lessonData Structures and Algorithms · Recursion and the call stack · 6 Sept 2026
I keep forgetting the base case. Every recursive call must move toward it. Draw the call stack for factorial(4).
Open the lessonData Structures and Algorithms · general note · 7 Sept 2026
Ask the tutor about when quicksort degrades to O(n^2).