Question: Algorithm Analysis question: Which of the following is the correct statement for T(n) order of growth: T(n) = c 0 *n + c 1 *n
Algorithm Analysis question:
Which of the following is the correct statement for T(n) order of growth:
T(n) = c0*n + c1*n + c2*n + c3*n + ... cn-2*n + cn-1*n
Where { c0, c1 ... cn-1 } are constants.
Question 3 options:
|
|
T(n) (n)
|
|
|
T(n) O(n)
|
|
|
T(n) (nn)
|
|
|
T(n) O(n2)
|
|
|
T(n) O(cn)
|
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
