Re: Spell checker optimizationn
> Although, I often use binary searches for the very reasons mentioned.
> (EASY) In fact, many times I will even use binary searches in un-sorted,
> linked lists or files. Although I have to parse through pointers, key
> comparisons are kept at a minimum.
How can you use a binary search on an unsorted list?
Most of my research goes into building a better brute force algorithm, since
the data I work with can get keys from anywhere in the dataspace. Sorting
beforehand therefore is more trouble than it's worth.
--
Cameron Kaiser * spectre at sserv.com * http://www.sserv.com/
--
Visit the leading Internet starting point today!
http://www.sserv.com/
--
|
Not Categorized, Please Help
|
|
