Big O notation

Indicate constant time complexity in terms of Big-O notation

• O(n)

• O(1)

• O(log n)

• O (n^2)

Indicate exponential time complexity in terms of big-O notation

• O (n)

• O (n^2)

• O (2^n)

• O (log n)

Find the slowest time complexity

• O (n)

• O (n^2)

• O (n!)

• O (2^n)

Which notation is consistent for every execution?

• O (n)

• O (n^2)

• O (1)

• O (2^n)

Which notation grows in proportion to the size of the input

• O (n)

• O (n^2)

• O (1)

• O (2^n)

Which notation would you usually use for a nested loop?

• O (n)

• O (n^2)

• O (1)

• O (2^n)

Indicate polynomial time complexity in terms of big-O notation

• O (n!)

• O (1)

• O (n^2)

• O (log n)

• 1 + 3n + n

• 3 + n

• 3n

• 1 + 3n

Which line best represents the time complexity n!

• Orange

• Blue

• Green

• Red

• Pink

Which line best represents the time complexity log n

• Orange

• Blue

• Green

• Red

• Pink