Question

Write MIPS code (with abundant explanatory comments) for recursive summation of N-numbers using the formal procedure of putting all arguments and other necessary variables on stack and getting them back before exit from the stack.

Answer 1

#include <stdio.h>

  

// Return sum of elements in A[0..N-1]

// using recursion.

int findSum(int A[], int N)

{

    if (N <= 0)

        return 0;

    return (findSum(A, N - 1) + A[N - 1]);

}

  

// Driver code

int main()

{

    int A[] = { 1, 2, 3, 4, 5 };

    int N = sizeof(A) / sizeof(A[0]);

    printf("%dn", findSum(A, N));

    return 0;

}