Recursion has more expressive power than iterative looping constructs. I say this because a while loop is equivalent to a tail recursive function and recursive functions need not be tail recursive.

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.

AWS recently announced a recursion control feature in AWS Lambda that detects and stops Lambda functions running in a recursive or infinite loop.

AWS recently announced a recursion control feature in AWS Lambda that detects and stops Lambda functions running in a recursive or infinite loop.

Recursion and while loops are user language constructs. Therefore, from a performance perspective, doesn't it all depend on how a compiler translates the code into machine language in the end?