Answer:
linear
Step-by-step explanation:
Answer:
Step-by-step explanation:
In this question, you are solving for n.
Solve:
−2p + 6n = 5
We have to get "n" by itself, so add 2p to both sides.
6n = 2p + 5
Since the variable "n" has a number next to it, we have to get rid of that number in order to get our answer.
To do so, we would divide both sides by 6.
Simplify the equation further.
The vertex to this quadratic equation is 2
I will be using the language C++. Given the problem specification, there are an large variety of solving the problem, ranging from simple addition, to more complicated bit testing and selection. But since the problem isn't exactly high performance or practical, I'll use simple addition. For a recursive function, you need to create a condition that will prevent further recursion, I'll use the condition of multiplying by 0. Also, you need to define what your recursion is.
To wit, consider the following math expression
f(m,k) = 0 if m = 0, otherwise f(m-1,k) + k
If you calculate f(0,k), you'll get 0 which is exactly what 0 * k is.
If you calculate f(1,k), you'll get 0 + k, which is exactly what 1 * k is.
So here's the function
int product(int m, int k)
{
if (m == 0) return 0;
return product(m-1,k) + k;
}
