Java Software Structures: Designing and Using Data StructuresThe 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. |
From inside the book
Results 1-3 of 58
Page 283
... insertion of objects , and removal of objects . The concept of access to objects includes operations such as contains , get , and indexof . In the case of an ArrayList , if the index of the object to be accessed is already known , then ...
... insertion of objects , and removal of objects . The concept of access to objects includes operations such as contains , get , and indexof . In the case of an ArrayList , if the index of the object to be accessed is already known , then ...
Page 347
Designing and Using Data Structures John Lewis, Joseph Chase. Insertion Sort The insertion sort algorithm sorts a ... insertion sort : // Sorts 11.2 SORTING 347 Insertion Sort.
Designing and Using Data Structures John Lewis, Joseph Chase. Insertion Sort The insertion sort algorithm sorts a ... insertion sort : // Sorts 11.2 SORTING 347 Insertion Sort.
Page 418
... Insertion into a Red / Black Tree Insertion into a red / black tree will progress much as it did in our earlier addElement method . However , we will always begin by setting the color of the new element to red . Once the new element has ...
... Insertion into a Red / Black Tree Insertion into a red / black tree will progress much as it did in our earlier addElement method . However , we will always begin by setting the color of the new element to red . Once the new element has ...
Other editions - View all
Java Software Structures: Designing and Using Data Structures John Lewis,Joseph Chase No preview available - 2004 |
Common terms and phrases
abstract data type abstract methods addAll addElement ancestor tree array implementation ArraySet<T AVL tree B-tree binary search tree binary tree BlackJack boolean Card Chapter child class class hierarchy complexity constructor contains count create data structure deck declared defined dequeue disks doubly linked list element stored empty evaluation example exception Figure graph hash table heap ImageIcon inheritance insertion instantiated integer interface invoked isEmpty iterator Java Collections API Key Concept left child Lewis/Chase LIBRARIES linear linked implementation linked list loop ment node null number of elements operand operation parameter parent particular path player position postfix expression problem provides public class public void queue radix sort recursive remove removeRandom represent return result Returns true right child root SAN DIEGO Self-Review Questions set collection sort algorithm stack static String System.out.println throw tion toString traversal UML description undirected graph waterfall model web crawler