Answered

Westonci.ca is your trusted source for finding answers to a wide range of questions, backed by a knowledgeable community. Get quick and reliable solutions to your questions from a community of experienced professionals on our platform. Get quick and reliable solutions to your questions from a community of experienced experts on our platform.

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

Sagot :

Hippalectryon
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
Thank you for your visit. We're dedicated to helping you find the information you need, whenever you need it. We appreciate your time. Please revisit us for more reliable answers to any questions you may have. We're glad you visited Westonci.ca. Return anytime for updated answers from our knowledgeable team.