A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing


  • one year ago

Hello everyone. This questions pertains to problem set 4, question number 4a. We are supposed to write a multi-level decryption algorithm that calls itself recursively and returns a group of tuples that can be used to decode the ciphertext. I am a bit stumped at the moment with the start variable. What does it do, also, what is the correct base case?

  • This Question is Open
  1. anonymous
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Hi! I just got done with problem set 4. It's a really tough one!! start is used to mark the place where the encrypted text starts. If you've already done problem 3 start is just the first variable in each of the tuples. but inside find_best_shifts_rec, it's really useful for recursion. As for the base case, this is my design RECURSIVE DESIGN: BASE CASES: if all the words in the decoded text are valid return a list with a tuple of the position and shift if there are no valid words in the decoded text return none RECURSIVE CASE: if the recursion doesn't return none return a list with a tuple of the start position and shift joined with the recursion

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


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