Question: What is this function's worst-case AND best-case big-oh runtime? int foo(int n) { int i, product = 1; for (i = 2; i < n;
What is this function's worst-case AND best-case big-oh runtime?
int foo(int n)
{
int i, product = 1;
for (i = 2; i < n; i++) { product = product * i; }
return product;
}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
