Ask Question
30 June, 21:42

3. Write a recursive algorithm of the sequence t (1) = 1 and t (n) = n2 t (n-1) as a function.

+4
Answers (1)
  1. 30 June, 23:28
    0
    int t (int n) {

    if (n = = 1)

    return 1;

    else

    return n*n*t (n-1);

    }

    Step-by-step explanation:

    A recursive function is a function that calls itself.

    I am going to give you an example of this algorithm in the C language of programming.

    int t (int n) {

    if (n = = 1)

    return 1;

    else

    return n*n*t (n-1);

    }

    The function is named t. In the else clause, the function calls itself, so it is recursive.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “3. Write a recursive algorithm of the sequence t (1) = 1 and t (n) = n2 t (n-1) as a function. ...” in 📘 Mathematics if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers