I'm trying to create a spellchecker program with dictionary stored in a file. My question is What is the best data structures to implement spell checking program. I'm using hashing right now but for a big size dictionary my program crashed because of overflow. Is there any better idea?(I'm using blodshed dev-C++ for my compiler)
So it's a bug in your implementation rather than any particular failing of the hash data structure.
Post your code here, since there seems to be a bug in it.
dwk
Seek and ye shall find. quaere et invenies.
"Simplicity does not precede complexity, but follows it." -- Alan Perlis
"Testing can only prove the presence of bugs, not their absence." -- Edsger Dijkstra
"The only real mistake is the one from which we learn nothing." -- John Powell
Other boards: DaniWeb, TPS
Unofficial Wiki FAQ: cpwiki.sf.net
My website: http://dwks.theprogrammingsite.com/
Projects: codeform, xuni, atlantis, nort, etc.
