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 18
In fact, it provides two implementations for lists: ArrayList and ^l!^!3.^!^°^! .^°"^'"t.T
° LinkedList. Both of these classes extend the abstract class java.util.AbstractList,
which implements the java.util.List interface. These are part of the Java class ...
Analysis of Indexed List Implementations The analysis of the time complexity for
the operations for the ArrayList and LinkedList implementations generally falls
into one of three categories: access to objects, insertion of objects, and removal
8.5 Implement the Josephus problem using a queue and compare the
performance of that algorithm to the ArrayList implementation from this chapter.
8.6 Implement an OrderedList using a LinkedList. 8.7 Implement an OrderedList
using an ...
What people are saying - Write a review
17 other sections not shown