Algorithms in Java

Several search methods proceed by examining the search keys one small piece at a time, rather than using full comparisons between keys at each step....

The simplest radix-search method is based on the use of digital search trees (DSTs). The search and insert algorithms are identical to binary tree search...

In this section, we consider a search tree that allows us to use the bits of the keys to guide the search, in the same...

Trie-based search as described in Section has two inconvenient flaws. First, the one-way branching leads to the creation of extra nodes in the trie, which...

For radix sorting, we found that we could get a significant improvement in speed by considering more than 1 bit at a time. The same...

In Section 12.5, we considered the process of building a string index, and we used binary search in a table of indexes into a text...