Give a recursive algorithm for ﬁnding the sum of the

ﬁrst n odd positive integers.

Question

Computers and Technology

Larson

6 February, 16:22

Give a recursive algorithm for ﬁnding the sum of the

ﬁrst n odd positive integers.

+4

Answers (1)

Know the Answer?

Davon Mahoney · Answer 1

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

Give a recursive algorithm for ﬁnding the sum of theﬁrst n odd positive integers.

Give a recursive algorithm for ﬁnding the sum of the

ﬁrst n odd positive integers.