USA: +1 (725) 712-1730 
Sign in
JAVA
17. What is the order of this algorithmic growth function?
t(n) = 15
| O(1) |
| O(n^2) |
| O(15) |
| O((n)
18. When specifying a growth function, t(n),what does the n stand for
|
Expert Answer
17. What is the order of this algorithmic growth function?
O(n^2)
18. When specifying a growth function, t(n),what does the n stand for
input size
19. Which order of growth grows the fastest?linear
exponential
20.The order of growth for an algorithm depends on they type of computer a person is using.
TRUE
