Search algorithm: Difference between revisions

Revision as of 23:12, 9 December 2001

Revision as of 01:36, 10 December 2001

Line 15:

There is a family of [[tree]] search algorithms that compare ordered keys with one another to see if they are greater or less; the simplest one uses a [[binary search tree]]; and there is a family of tree [[data structure|data structures]] known as [[trie|tries]] (<i>what is this trie thing ?</i>) that don't comparerequire keysa withkey onecompare anotheruntil exceptthe atend of the endsearch.