def recursiveAbecedarian(word):
    """
    Returns True if letters within word are arranged alphabetically.
    This function does this recursively.
    """
    #alternate implementation, not mine
    
    if len(word) <=1:
        return True
    if word[0] > word[1]:
        return False
    recursiveAbecedarian(word[1:])