Answer
--Giving a recursive algorithm for finding the sum of the
first n positive integers.
Work Step by Step
--procedure sum of odds(n: positive integer)
-if n = 1 then return 1
-else return sum of odds (n − 1) + 2n − 1
You can help us out by revising, improving and updating this answer.
Update this answerAfter you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.