Algorithms in Java

The retrieval of a particular piece or pieces of information from large volumes of previously stored data is a fundamental operation, called search, that is...

As with priority queues, we think of search algorithms as belonging to interfaces declaring a variety of generic operations that can be separated from particular...

Suppose that the keys are small integers (as is the case, for example, with Programs and 12.4). In this case, the simplest search algorithm is...

For general key values from too large a range for them to be used as indices, one simple approach for a symbol-table implementation is to...

In the array implementation of sequential search, we can reduce significantly the total search time for a large set of items by using a search...

For many applications we want a search structure simply to help us find items, without moving them around. For example, we might have an array...

Insertions into ordered lists and searches in unordered lists are both expensive, so neither data structure is useful when we have a mix of such...

The running times of algorithms on binary search trees are dependent on the shapes of the trees. In the best case, the tree could be...

In the standard implementation of BSTs, every new node inserted goes somewhere at the bottom of the tree, replacing some external node. This state of...

The recursive implementations given in Section for the fundamental search, insert, and sort operations using binary tree structures are straightforward. In this section, we consider...