Programming

• the three key components of a recursive algorithm is : a base case, the function calling itself with any value other than the base case, the base case being reachable
• the three key components of a recursive algorithm is : a base case, the function calling itself with any value other than the base case, the base case being reachable within a finite number of times.
• without a base case a recursive algorithm will never stop and cause stack overflow