Ask Question
14 September, 11:34

Recursively computing the sum of the first n positive odd integers. About (a) Give a recursive algorithm which takes as input a positive integer n and returns the sum of the first n positive odd integers.

+3
Answers (1)
  1. 14 September, 13:11
    0
    Following are the Algorithm of the program:

    Step-1: Start.

    Step-2: Define function 'sum_of_odd (num) '.

    Step-3: Check, If num < 1

    Then, return 0.

    Otherwise, else

    Then, return (2 * n - 1) + sum_odds (n - 1).

    Step-4: Call the function.

    Step-5: Stop.
Know the Answer?
Not Sure About the Answer?
Get an answer to your question ✅ “Recursively computing the sum of the first n positive odd integers. About (a) Give a recursive algorithm which takes as input a positive ...” in 📙 Computers & Technology if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers