The basic concept of recursion is straightforward: a given chunk of code calls itself until some boundary condition is reached. Arthur Fuller demonstrates how to use recursion in T-SQL.

I have written a function to calculate the Runge-Kutta numerical approximation of the differential equation dy/dt = -2ty^2 w/ initial conditions y(0)=1 from t=0 to t=10. The function worked when I ...