 # Spell Checker Using Hash Table

## Question

Implement a spell checker using a hash table with open addressing (x is the key, m the size of the hash table and i iteration):

Linear probing, h(x)=(x+i)%m
Double hashing. The i-th index in the probing is computed as h(x)=(x+i*h’(x))%m, where h’ is a function mapping integers to non-zero values. A common choice is h’(x)=1+x%q, for a prime q less than m.

## Solution Preview

This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.

#include <string.h>

#include "definition.h"

word * newWord(const char * key){
word * new_word = (word *)malloc(sizeof(word));
if (new_word == NULL) {
return NULL;
}
new_word->key = (char *)calloc(strlen(key),sizeof(char));

if (new_word->key != NULL) {
strcpy(new_word->key, key);
}
new_word->state = in_used;
return new_word;
}

hashtable * newHashTable(unsigned int capacity, double factor){
int i;
hashtable * hash = (hashtable *)malloc(sizeof(hashtable));
if (hash == NULL) {
return NULL;
}
hash->capacity = capacity;
hash->size = 0;
hash->factor = factor;
hash->words = (word **)calloc(capacity, sizeof(word *));

for (i = 0; i < capacity; i++) {
hash->words[i] = NULL;
}

return hash;
}...
\$75.00 for this solution

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

### Find A Tutor

View available C-Family Programming Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.