lib/exercises-in-programming-style
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Made the recursive program a bit simpler

Browse Source
This commit is contained in:
Crista Lopes
2014-03-18 16:44:31 -07:00
parent 1373ed542d
commit 0311a99b47
1 changed files with 4 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
07-infinite-mirror/tf-07.py
View File

@@ -11,29 +11,24 @@ def count(word_list, stopwords, wordfreqs):
# What to do with an empty list
if word_list == []:
return
# The base case, what to do with 1 word
if len(word_list) == 1:
# The inductive case, what to do with a list of words
else:
# Process the head word
word = word_list[0]
if word not in stopwords:
if word in word_freqs:
wordfreqs[word] += 1
else:
wordfreqs[word] = 1
# The inductive case, what to do with a list of words
else:
# Process the head word
count([word_list[0]], stopwords, wordfreqs)
# Process the tail
count(word_list[1:], stopwords, wordfreqs)
def wf_print(wordfreq):
if wordfreq == []:
return
if len(wordfreq) == 1:
else:
(w, c) = wordfreq[0]
print w, '-', c
else:
wf_print([wordfreq[0]])
wf_print(wordfreq[1:])
stop_words = set(open('../stop_words.txt').read().split(','))