Complexity & Big O

Learning Objectives

• Identify O(1), O(N), O(N^2), and O(log N) algorithms.
• Calculate the worst-case time complexity of nested loops.
• Evaluate the space complexity tradeoffs in recursive functions.

Core Topics

Practical Exercise

Write two different functions to find duplicates in an array (one using nested loops, one using a hash set) and mathematically prove their differing Big O complexities.

Recommended Learning Resources