646 views
3 votes
3 votes

Consider the code below, defining the function $A$:

A(m, n, p) {
    if (p == 0) return m+n;
    else if (n == 0 && p == 1) return 0;
    else if (n == 0 && p == 2) return 1;
    else if (n == 0) return m;
    else return A(m, A(m,n-1,p), p-1);
}

Express $A(m, n, 1)$ as a function of $m$ and $n$.

2 Answers

1 votes
1 votes

A(m, n, 1) = A(m, A(m, n -1, 1) ,0)

To compute this we solve the base cases first:

The base case is : A(m, 0, 1) = 0 = m∗0
So the value of  : A(m,n -1,1) = m(n-1)

So A(m,n,1)=A(m, m(n-1) ,0)

                  =m+m(n-1)

      A(m,n,1) =mn

Related questions

3 votes
3 votes
2 answers
1
go_editor asked May 27, 2016
618 views
Consider the code below, defining the function $A$:A(m, n, p) { if (p == 0) return m+n; else if (n == 0 && p == 1) return 0; else if (n == 0 && p == 2) return 1; else if ...
3 votes
3 votes
2 answers
2
2 votes
2 votes
2 answers
4
go_editor asked May 27, 2016
428 views
Let $A$ be array of $n$ integers that is not assumed to be sorted. You are given a number $x$. The aim is to find out if there are indices $k,\: l$ and $m$ such that $A[...