Session Ready
Exercise

Practicing with Big O Notation

In this exercise, you will keep practicing your understanding of Big O notation.

In the first step, you will create an algorithm that prints all the elements of the following list:

colors = ['green', 'yellow', 'blue', 'pink']

The algorithm will have an \(O(n)\) complexity.

In the second and third steps, you will calculate the complexity of two algorithms.

Instructions 1/3
undefined XP
  • 1
  • 2
  • 3
  • Iterate over the elements of the list.
  • Inside the loop, print the current element of the list.
Loading