Java Software Structures: Designing and Using Data Structures
The second edition of Java Software Structures embraces the enhancements of Java 5.0, where all structures and collections are based on generics. The framework of the text walks the reader through three main areas: conceptualization, explanation, and implementation, allowing for a consistent and coherent introduction to data structures. The addition of integrated case studies provides complete examples to aid readers starting with the problem statement, to design rationale, through full implementation. Readers will learn how to develop high-quality software systems using well-designed collections and algorithms.
Results 1-3 of 11
17.1 A HASHING In all of our discussions of the implementations of collections,
we have proceeded with one of three ... In hashing, elements are stored in a hash
table, with their location in the table determined by a hashing function.
If a perfect hashing function is not available or practical but the size of the data
set is known, a good rule of thumb is to make the table 150 percent the size of the
data set. The third case is very common and far more interesting. What if we do ...
Summary of Key Concepts > In hashing, elements are stored in a hash table, with
their location in the table determined by a hashing function. > The situation where
two elements or keys map to the same location in the table is called a collision ...
What people are saying - Write a review
17 other sections not shown