DSA 4: Run-Time & Big-O

Exponential

Identify the order of complexity that is denoted by this big-O notation: O(2ⁿ)

Linear

Identify the order of complexity that is denoted by this big-O notation: O(n)

Quadratic

Identify the order of complexity that is denoted by this big-O notation: O(n²)

Constant

What order of complexity does O(1) represent?

Exponential

What order of complexity does O(2ⁿ) represent?

Logarithmic

What order of complexity does O(log n) represent?

Log-Linear

What order of complexity does O(n log n) represent?

Linear

What order of complexity does O(n) represent?

Quadratic

What order of complexity does O(n²) represent?

O(1)

Which big-O notation represents a constant order of complexity?

O(n)

Which big-O notation represents a linear order of complexity?

O(log n)

Which big-O notation represents a logarithmic order of complexity?

O(1)

Which of the following runtime complexity categories would represent the best asymptotic performance? • O(1) • O(n²) • O(n) • O(log n)

O(log n)

Which of the following runtime complexity categories would represent the best asymptotic performance? • O(n) • O(n²) • O(log n) • O(n log n)

O(n²)

Which of the following runtime complexity categories would represent the worst asymptotic performance? • O(n²) • O(1) • O(n) • O(n log n)

O(2ⁿ)

Which of the following runtime complexity categories would represent the worst asymptotic performance? • O(n²) • O(n log n) • O(2ⁿ) • O(n)