A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

anonymous

  • 5 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
  1. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    def 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.

  2. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    I'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.

  3. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    nvm, I've got something I'm happier with.

  4. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

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
  • 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.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.