Question

ps3a - I'm not understanding the countSubStringMatchRecursive part. What exactly are we trying to do here? Can someone explain the goal of this function in 'English'? :)

Answer 1

You want to do the exact same thing as "countSubStringMatch" but while using a recursive method, instead of an iterative method.

A recursive function is defining a function by itself. Here's an example.

f(x) = 5 + f(x-1)

If we say that f(0) = 50, then f(x) = 5x + 50

Clear enough?

Answer 2

could you put that example into some Python code? I get the concept but I'm not grasping how you would implement it.

Thanks!

Answer 3

def fib(x):
if x==0 or x==1:
return 1
else:
return fib(x-1) + fib(x-2)

Answer 4

You can google "Fibonacci" to get the concept

Answer 5

great, thanks!