Exponents Question
View this question.
Add this question to a group or test by clicking the appropriate button below.
Grade 11 Exponents CCSS: HSF-LE.A.3
Algorithm A: [math]T_alpha(n) = 100n + 500[/math] (ms)
Algorithm B: [math]T_beta(n) = 2^n[/math](ms)
For very large n, what is expected?
- Algorithm A will always run faster.
- Algorithm B will always run faster.
- Algorithm B will run faster for small n, but Algorithm A will be faster for large n.
- Algorithm A will run faster for small n, but Algorithm B will be faster for large n.
