Previous Lecture

lect07

Next Lecture

lect07, Wed 01/31

Week 4: Space complexity, best/worst case analysis

Code from lecture

https://github.com/ucsb-cs24-w24/cs24-w24-lectures/tree/main/lect07

Topics

• Big Omega and big theta
• Define space complexity of an algorithm
• Best case and worst case analysis of binary search, operations on sorted arrays, balanced and unbalanced BSTs