DSA 4. Run-Time & Big-O
Constant - answer What order of complexity does O(1) represent?
Logarithmic - answer What order of complexity does O(log n) represent?
Linear - answer What order of complexity does O(n) represent?
Log-Linear - answer What order of complexity does O(n log n) represent?
Quadratic - answer What order of complexity does O(n²) represent?
Exponential - answer What order of complexity does O(2ⁿ) represent?
O(1) - answer Which of the following runtime complexity categories would represent the
best asymptotic performance?
• O(1)
• O(n²)
• O(n)
• O(log n)
O(n²) - answer Which of the following runtime complexity categories would represent
the worst asymptotic performance?
• O(n²)
• O(1)
• O(n)
• O(n log n)
O(log n) - answer 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(2ⁿ) - answer Which of the following runtime complexity categories would represent
the worst asymptotic performance?
• O(n²)
Constant - answer What order of complexity does O(1) represent?
Logarithmic - answer What order of complexity does O(log n) represent?
Linear - answer What order of complexity does O(n) represent?
Log-Linear - answer What order of complexity does O(n log n) represent?
Quadratic - answer What order of complexity does O(n²) represent?
Exponential - answer What order of complexity does O(2ⁿ) represent?
O(1) - answer Which of the following runtime complexity categories would represent the
best asymptotic performance?
• O(1)
• O(n²)
• O(n)
• O(log n)
O(n²) - answer Which of the following runtime complexity categories would represent
the worst asymptotic performance?
• O(n²)
• O(1)
• O(n)
• O(n log n)
O(log n) - answer 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(2ⁿ) - answer Which of the following runtime complexity categories would represent
the worst asymptotic performance?
• O(n²)
