View difference between Paste ID: ZNeFjcVE and PXpvB1Qr

-import random
+
     if word.startswith(frag)==True:
-# -----------------------------------
+
-# Helper code
+
-# (you don't need to understand this helper code)
+
 def exist_word(wordlist, frag, first, last):
-import string
+
     Binary search.
-WORDLIST_FILENAME = "words.txt"
+
 
-def load_words():
+    print first, last, call, wordlist[last], frag
     mid = first + ((last-first)/2)
-    Returns a list of valid words. Words are strings of lowercase letters.
+    print mid, wordlist[mid]
-    Depending on the size of the word list, this function may
+
-    take a while to finish.
+
     ##Note: The wordlist[last] is always less than word fragment or, if it exists,
-    print "Loading word list from file..."
+    ## 1 before the fragment. Therefore, compare with wordlist[last+1]
-    # inFile: file
+
-    inFile = open(WORDLIST_FILENAME, 'r', 0)
+
-    # wordlist: list of strings
+
-    wordlist = []
+
-    for line in inFile:
+
-        wordlist.append(line.strip().lower())
+
-    print "  ", len(wordlist), "words loaded."
+
-    return wordlist
+
 
-def get_frequency_dict(sequence):
+
             return True
-    Returns a dictionary where the keys are elements of the sequence
+
-    and the values are integer counts, for the number of times that
+
-    an element is repeated in the sequence.
+    return exist_word(wordlist, frag, mid + 1, last)