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 39
Collections can be separated into two broad categories: linear and nonlinear. As
the name implies, a linear collection is one in which the elements of the collection
are organized in a straight line. A nonlinear collection is one in which the ...
This section examines two common approaches to searching: a linear search
and a binary search. Later in this book other search techniques are presented
that use the characteristics of particular data structures to facilitate the search
Thus we see that linear probing may not be the best approach. A second form of
the open addressing method is quadratic probing. Using quadratic probing,
instead of using a linear approach, once we have a collision, we follow a formula
What people are saying - Write a review
17 other sections not shown