Register now or log in to join your professional community.
Recursion requires lots of resources (computing power and memory). How to plan for best possible performance?
Use of Dynamic Memory Allocation to Overcome Stack Overflow and Conversion of the Recursive Function into a Simple Class of Loop for the Function may help.SomeReferenceType value = new SomeReferenceType();That's dynamic memory allocation.
