A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 6 years ago
I'm really having trouble with Problem 1 in set 3. I'm using the result of a find as my test in the recursive function but it's not working.
anonymous
 6 years ago
I'm really having trouble with Problem 1 in set 3. I'm using the result of a find as my test in the recursive function but it's not working.

This Question is Closed

anonymous
 6 years ago
Best ResponseYou've already chosen the best response.0def recursion(target, key, ans=()): print find(target,key) if (find(target,key)) ==1: return ans while find(target,key) != 1: ans += (len(target),) print ans recursion(target[find(target,key)+len(key):], key, ans) is what I'm using, but even when find(target,key) == 1, it still doesn't trigger the following if statement.

anonymous
 6 years ago
Best ResponseYou've already chosen the best response.0I'm using this as a recursive function within my solution. it's meant to return a tuple called ans that lists the successive lengths of the target string as it's shortened. from that I can determine the number of finds in the original string and their locations. I suspect there's a better way, but I'm not that bright.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0nvm, I've got something I'm happier with.
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.