Example 1: We iterate over every manatee in the manatees list with the for loop. Since we're given that manatees has n elements, our code will take approximately O(n) time to run. Example 2 We look at ...

1. Understand the basics of Big O notation. Big O notation is a way of expressing how long an algorithm takes to run as a function of its input size (n). It helps developers and programmers compare ...

This repo contains some example files to practice determining big O time and space complexity. It also contains a few visualizations. I would suggest looking at the examples in random order. Scroll ...