anonymous
  • anonymous
need help with my function for p4 in pset 4: for shift in range(28): startpoint = start switch = False newtext= apply_shift(text[start: ], -shift) words = newtext.split() for word in words: if is_word(wordlist, word) == True: startpoint = startpoint + len(word) switch = True if switch == True: if startpoint == len(text): return [(start, shift)] else: return [(start, shift)] + find_best_shifts(wordlist, text[0:start]+newtext, startpoint+1)
MIT 6.00 Intro Computer Science (OCW)
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
andrew.m.higgs
  • andrew.m.higgs
An explanation of what is expected could be useful.
anonymous
  • anonymous
I figured out! Thank you
andrew.m.higgs
  • andrew.m.higgs
:-)

Looking for something else?

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

More answers

anonymous
  • anonymous
Is the hangman problem I think, if is the problem for the computer to find the best hand, you'll have to test each word, but before check the hand, so your range wouldn't be the 80K words.

Looking for something else?

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