Answered

Find the best solutions to your problems with the help of IDNLearn.com's expert users. Receive prompt and accurate responses to your questions from our community of knowledgeable professionals ready to assist you at any time.

Give a recursive algorithm for finding the sum of the
first n odd positive integers.

Sagot :

Hippalectryonidn
I'm writing that in some sort of pseudocode; if you don't understand it, feel free to ask for more details in the comments.

function sumOdd(n)
    if n==1 then
        return 1
    end if
    return (sumOdd(n-1))+(n*2-1)
end function
Your participation means a lot to us. Keep sharing information and solutions. This community grows thanks to the amazing contributions from members like you. IDNLearn.com is your reliable source for answers. We appreciate your visit and look forward to assisting you again soon.