Algorithms for Finding | ||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
||||||||||||||||
|
||||||||||||||||
When you can't see the Wood for the Trees. |
This section deals with finding data.
How you go about finding data depends on the original layout of the data.
Since other sites cover the principles involved, the intention is to cover things that don't seem to be well explained elsewhere.
This isn't all search algorithms; there is code here to find the Time accurately using Atomic Clocks that are accessible over the Internet!
The other things here were designed for a simple spell-checker:
The simplest most accessible spell-checker will separate text into words [WordFinder] then look for the current word in a dictionary (which may be a text file of valid words, one on each line).
The best way to search such a dictionary would be to use the Binary Chop search algorithm.