resumos/cursos/cs50/all-challenges/problems/speller/speller.c
bool check(const char *word)
{
    unsigned int hashIndex = hash(word);

    // head
    node *cursor = table[hashIndex];

    if (cursor == NULL)
    {
        return false;
    }
    // strcasecmp(word, cursor)

    while (cursor != NULL)
    {
        int compare = strcasecmp(word, cursor->word);
        if (compare == 0)
        {
            return true;
        }
        cursor = cursor->next;
    }

    return false;
}
// Returns true if word is in dictionary, else false

Returns true if word is in dictionary, else false
Returns true if word is in dictionary else false
bool check(const char *word)
{
    unsigned int hashIndex = hash(word);
    node *cursor = table[hashIndex];
    if (cursor == NULL)
    {
        return false;
    }
    while (cursor != NULL)
    {
        int compare = strcasecmp(word, cursor->word);
        if (compare == 0)
        {
            return true;
        }
        cursor = cursor->next;
    }
    return false;
}
bool check ( const char * word ) { unsigned int hashIndex = hash ( word ) ; node * cursor = table [ hashIndex ] ; if ( cursor == NULL ) { return false ; } while ( cursor != NULL ) { int compare = strcasecmp ( word , cursor -> word ) ; if ( compare == 0 ) { return true ; } cursor = cursor -> next ; } return false ; }
Returns true if word is in dictionary, else false
Returns true if word is in dictionary else false
// head
 // strcasecmp(word, cursor)
