this->      alpha 
other->     alphabets
       ----------------
            00-
it is legal to do this   
int diff = letters[i] - other.letters[i]
if diff is non zero then just return diff
if one of the strings runs out of letters
the longer string wins all ties 


sentence: "the dorty brown fox jumped down on the lazy do"
the key:      "dog"

keyStart = indexOf( key );
if it come back -1 then what?  RET FALSE

otherwise start looking at sentence[keyStart]
compare the indiv letters of the key against the letters of the sentence starting at keyStart use length of key
to control the loop  *worry about out of bounds  errs

if its not a match then what?
do that indexOf call again with keyStart+1