A linear search algorithm in C
In this episode we finish our "naive" implementation of the tree, by coding the linear search and lookup functions. We then import a list of 70 000 English words and we create a leaf out of every one. They are put in folders like /a/b/c depending on the word's initial character.
This will make it possible to do calculations of how fast it is, so we know what to optimize. Remember, our very serious goal is making this the fastest in the world.
References:
Ep01: Coding a binary tree in C
• Project: Coding your own database str...
Ep02: Coding a pretty-printer in C
• Project: Coding a Pretty-printer in C