Answer:
Multiply(m,n)
1. Initialize product=0.
2. for i=1 to n
3. product = product +m.
4. Output product.
Explanation:
Here we take the variable "product" to store the result m×n. And in this algorithm we find m×n by adding m, n times.
Answer:
O(n^2)
Explanation:
The number of elements in the array X is proportional to the algorithm E runs time:
For one element (i=1) -> O(1)
For two elements (i=2) -> O(2)
.
.
.
For n elements (i=n) -> O(n)
If the array has n elements the algorithm D will call the algorithm E n times, so we have a maximum time of n times n, therefore the worst-case running time of D is O(n^2)
Answer : Candice
Explanation: Candice penis fit in your mouth
