Most of you never use recursive algorithms, after your college days.
Here is the question related to recursive to brush up your knowledge.
Here is the sequence
0,1,4,25,676,458329,210066388900,44127887745906175987801,.....
Write the recursive procedure (pseduo code is enough) for the above
sequence. E.g. seq(1) = 0 , seq(2) = 1, etc.
All the best.
seq(1)=0 , seq(n)=(seq(n-1)+1)^2