Give a recursive (or non-recursive) algorithm to compute the product of two positive integers, m and n, using only addition and subtraction ?

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; i believe the correct answer is (classes);

776 colleges and universities. it is also accredited 3,852 applied and natural science, computing, engineering and engineering technology programs. i hope this .