A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 5 years ago
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'? :)
anonymous
 5 years ago
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'? :)

This Question is Closed

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0You 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(x1) If we say that f(0) = 50, then f(x) = 5x + 50 Clear enough?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0could you put that example into some Python code? I get the concept but I'm not grasping how you would implement it. Thanks!

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0def fib(x): if x==0 or x==1: return 1 else: return fib(x1) + fib(x2)

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0You can google "Fibonacci" to get the concept
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.