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)

Question

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)

andrew.m.higgs · Answer

An explanation of what is expected could be useful.

anonymous · Answer

I figured out! Thank you

andrew.m.higgs · Answer

:-)

anonymous · Answer

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.