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

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

Through the process of sedimentation,sediment is turned back to rock to form sedimentation.the process of sedimentation is: > deposition-where fragments were deposited into the river or sea under gravity or travelling agent such as wind or water. > sedimentation-the fragments deposited in the river sedimented and accumulate> compaction-the layers of fragments deposited undergoes compaction due to the weight if the upper layers> cementation-chemical substance of the fragments such as cement dissolved into the water and cement the other fragments together to form sedimentary rock.thus,cementation and compaction are the process.on the other hand, transformation only occur when a rock under goes metamorphism(compaction or extreme heat).while recrystillization occurs when a rock is melted and cooled down,which also requires metamorphism to take place.hope it !

This is not computer related