@Hlaaftana1d, I might be completely off here about what you are suggesting, if so let me know.
It seems to me, though, that you are doing a linear search through the table for the correct key. With only 256 possibilities this isn't necessarily _terrible_ , but there is another part to a typical hash table: key placement. If the keys are placed in a predictable location and collisions are handled, the table may have to only scan a few keys to find the correct value. On the other, this adds significant complexity and can require allocations (for rehashing), not to mention one would have to benchmark to see if for such simply compared `char` keys there's an appreciable slowdown.
