Book description
Although traditional texts present isolated algorithms and data structures, they do not provide a unifying structure and offer little guidance on how to appropriately select among them. Furthermore, these texts furnish little, if any, source code and leave many of the more difficult aspects of the implementation as exercises. A fresh alternative to
Table of contents
- Front cover (1/2)
- Front cover (2/2)
- Contents (1/4)
- Contents (2/4)
- Contents (3/4)
- Contents (4/4)
- Preface
- Acknowledgments
- Authors
- Part I. INTRODUCTION
- Chapter 1. Design Principles (1/3)
- Chapter 1. Design Principles (2/3)
- Chapter 1. Design Principles (3/3)
- Chapter 2. Selecting an Abstract Data Type (1/4)
- Chapter 2. Selecting an Abstract Data Type (2/4)
- Chapter 2. Selecting an Abstract Data Type (3/4)
- Chapter 2. Selecting an Abstract Data Type (4/4)
- Chapter 3. How to Use This Book (1/2)
- Chapter 3. How to Use This Book (2/2)
- Part II. COLLECTION DATASTRUCTURES ANDALGORITHMS
- Chapter 4. Part II Organization
- Chapter 5. Foundations (1/5)
- Chapter 5. Foundations (2/5)
- Chapter 5. Foundations (3/5)
- Chapter 5. Foundations (4/5)
- Chapter 5. Foundations (5/5)
- Chapter 6 .Partition ADT and the Union-Find Data Structure (1/4)
- Chapter 6 .Partition ADT and the Union-Find Data Structure (2/4)
- Chapter 6 .Partition ADT and the Union-Find Data Structure (3/4)
- Chapter 6 .Partition ADT and the Union-Find Data Structure (4/4)
- Chapter 7. Collection of Elements (1/2)
- Chapter 7. Collection of Elements (2/2)
- Chapter 8. Abstract Collection (1/3)
- Chapter 8. Abstract Collection (2/3)
- Chapter 8. Abstract Collection (3/3)
- Chapter 9. Positional Collection ADT (1/3)
- Chapter 9. Positional Collection ADT (2/3)
- Chapter 9. Positional Collection ADT (3/3)
- Chapter 10. Abstract Positional Collection
- Chapter 11. Array Data Structure (1/10)
- Chapter 11. Array Data Structure (2/10)
- Chapter 11. Array Data Structure (3/10)
- Chapter 11. Array Data Structure (4/10)
- Chapter 11. Array Data Structure (5/10)
- Chapter 11. Array Data Structure (6/10)
- Chapter 11. Array Data Structure (7/10)
- Chapter 11. Array Data Structure (8/10)
- Chapter 11. Array Data Structure (9/10)
- Chapter 11. Array Data Structure (10/10)
- Chapter 12. Circular Array Data Structure (1/3)
- Chapter 12. Circular Array Data Structure (2/3)
- Chapter 12. Circular Array Data Structure (3/3)
- Chapter 13. Dynamic Array and Dynamic Circular Array Data Structures (1/2)
- Chapter 13. Dynamic Array and Dynamic Circular Array Data Structures (2/2)
- Chapter 14. Tracked Array Data Structure (1/5)
- Chapter 14. Tracked Array Data Structure (2/5)
- Chapter 14. Tracked Array Data Structure (3/5)
- Chapter 14. Tracked Array Data Structure (4/5)
- Chapter 14. Tracked Array Data Structure (5/5)
- Chapter 15. Singly Linked List Data Structure (1/8)
- Chapter 15. Singly Linked List Data Structure (2/8)
- Chapter 15. Singly Linked List Data Structure (3/8)
- Chapter 15. Singly Linked List Data Structure (4/8)
- Chapter 15. Singly Linked List Data Structure (5/8)
- Chapter 15. Singly Linked List Data Structure (6/8)
- Chapter 15. Singly Linked List Data Structure (7/8)
- Chapter 15. Singly Linked List Data Structure (8/8)
- Chapter 16. Doubly Linked List Data Structure (1/2)
- Chapter 16. Doubly Linked List Data Structure (2/2)
- Chapter 17. Buffer ADT and Its Implementation (1/2)
- Chapter 17. Buffer ADT and Its Implementation (2/2)
- Chapter 18. Queue ADT and Implementation
- Chapter 19. Stack ADT and Implementation
- Chapter 20. Set ADT (1/3)
- Chapter 20. Set ADT (2/3)
- Chapter 20. Set ADT (3/3)
- Chapter 21. Direct Addressing Data Structure (1/3)
- Chapter 21. Direct Addressing Data Structure (2/3)
- Chapter 21. Direct Addressing Data Structure (3/3)
- Chapter 22. Open Addressing Data Structure (1/4)
- Chapter 22. Open Addressing Data Structure (2/4)
- Chapter 22. Open Addressing Data Structure (3/4)
- Chapter 22. Open Addressing Data Structure (4/4)
- Chapter 23. Separate Chaining Data Structure (1/5)
- Chapter 23. Separate Chaining Data Structure (2/5)
- Chapter 23. Separate Chaining Data Structure (3/5)
- Chapter 23. Separate Chaining Data Structure (4/5)
- Chapter 23. Separate Chaining Data Structure (5/5)
- Chapter 24. Priority Queue ADT (1/2)
- Chapter 24. Priority Queue ADT (2/2)
- Chapter 25. Binary Heap Data Structure (1/4)
- Chapter 25. Binary Heap Data Structure (2/4)
- Chapter 25. Binary Heap Data Structure (3/4)
- Chapter 25. Binary Heap Data Structure (4/4)
- Chapter 26. Leftist Heap Data Structure (1/6)
- Chapter 26. Leftist Heap Data Structure (2/6)
- Chapter 26. Leftist Heap Data Structure (3/6)
- Chapter 26. Leftist Heap Data Structure (4/6)
- Chapter 26. Leftist Heap Data Structure (5/6)
- Chapter 26. Leftist Heap Data Structure (6/6)
- Chapter 27. Pairing Heap Data Structure (1/5)
- Chapter 27. Pairing Heap Data Structure (2/5)
- Chapter 27. Pairing Heap Data Structure (3/5)
- Chapter 27. Pairing Heap Data Structure (4/5)
- Chapter 27. Pairing Heap Data Structure (5/5)
- Chapter 28. Fibonacci Heap Data Structure (1/4)
- Chapter 28. Fibonacci Heap Data Structure (2/4)
- Chapter 28. Fibonacci Heap Data Structure (3/4)
- Chapter 28. Fibonacci Heap Data Structure (4/4)
- Chapter 29. Ordered Collection ADT (1/3)
- Chapter 29. Ordered Collection ADT (2/3)
- Chapter 29. Ordered Collection ADT (3/3)
- Chapter 30. Sorted Array Data Structure (1/4)
- Chapter 30. Sorted Array Data Structure (2/4)
- Chapter 30. Sorted Array Data Structure (3/4)
- Chapter 30. Sorted Array Data Structure (4/4)
- Chapter 31. Abstract Search Tree Class (1/2)
- Chapter 31. Abstract Search Tree Class (2/2)
- Chapter 32. Binary Search Tree Data Structure (1/6)
- Chapter 32. Binary Search Tree Data Structure (2/6)
- Chapter 32. Binary Search Tree Data Structure (3/6)
- Chapter 32. Binary Search Tree Data Structure (4/6)
- Chapter 32. Binary Search Tree Data Structure (5/6)
- Chapter 32. Binary Search Tree Data Structure (6/6)
- Chapter 33. Balanced Binary Search Trees
- Chapter 34. Red-Black Tree Data Structure (1/4)
- Chapter 34. Red-Black Tree Data Structure (2/4)
- Chapter 34. Red-Black Tree Data Structure (3/4)
- Chapter 34. Red-Black Tree Data Structure (4/4)
- Chapter 35. Splay Tree Data Structure (1/3)
- Chapter 35. Splay Tree Data Structure (2/3)
- Chapter 35. Splay Tree Data Structure (3/3)
- Chapter 36. B-Tree Data Structure (1/6)
- Chapter 36. B-Tree Data Structure (2/6)
- Chapter 36. B-Tree Data Structure (3/6)
- Chapter 36. B-Tree Data Structure (4/6)
- Chapter 36. B-Tree Data Structure (5/6)
- Chapter 36. B-Tree Data Structure (6/6)
- Chapter 37. B+-Tree Data Structure (1/4)
- Chapter 37. B+-Tree Data Structure (2/4)
- Chapter 37. B+-Tree Data Structure (3/4)
- Chapter 37. B+-Tree Data Structure (4/4)
- Chapter 38. Skip List Data Structure (1/6)
- Chapter 38. Skip List Data Structure (2/6)
- Chapter 38. Skip List Data Structure (3/6)
- Chapter 38. Skip List Data Structure (4/6)
- Chapter 38. Skip List Data Structure (5/6)
- Chapter 38. Skip List Data Structure (6/6)
- Chapter 39. Digitized Ordered Collection ADT (1/4)
- Chapter 39. Digitized Ordered Collection ADT (2/4)
- Chapter 39. Digitized Ordered Collection ADT (3/4)
- Chapter 39. Digitized Ordered Collection ADT (4/4)
- Chapter 40. Trie Node Types
- Chapter 41. Trie Data Structure (1/7)
- Chapter 41. Trie Data Structure (2/7)
- Chapter 41. Trie Data Structure (3/7)
- Chapter 41. Trie Data Structure (4/7)
- Chapter 41. Trie Data Structure (5/7)
- Chapter 41. Trie Data Structure (6/7)
- Chapter 41. Trie Data Structure (7/7)
- Chapter 42. Compact Trie Data Structure (1/3)
- Chapter 42. Compact Trie Data Structure (2/3)
- Chapter 42. Compact Trie Data Structure (3/3)
- Chapter 43. Compressed Trie Data Structure (1/3)
- Chapter 43. Compressed Trie Data Structure (2/3)
- Chapter 43. Compressed Trie Data Structure (3/3)
- Chapter 44. Patricia Trie Data Structure (1/5)
- Chapter 44. Patricia Trie Data Structure (2/5)
- Chapter 44. Patricia Trie Data Structure (3/5)
- Chapter 44. Patricia Trie Data Structure (4/5)
- Chapter 44. Patricia Trie Data Structure (5/5)
- Chapter 45. Ternary Search Trie Data Structure (1/2)
- Chapter 45. Ternary Search Trie Data Structure (2/2)
- Chapter 46. Spatial Collection ADT (1/2)
- Chapter 46. Spatial Collection ADT (2/2)
- Chapter 47. KD-Tree Data Structure (1/5)
- Chapter 47. KD-Tree Data Structure (2/5)
- Chapter 47. KD-Tree Data Structure (3/5)
- Chapter 47. KD-Tree Data Structure (4/5)
- Chapter 47. KD-Tree Data Structure (5/5)
- Chapter 48. Quad Tree Data Structure (1/6)
- Chapter 48. Quad Tree Data Structure (2/6)
- Chapter 48. Quad Tree Data Structure (3/6)
- Chapter 48. Quad Tree Data Structure (4/6)
- Chapter 48. Quad Tree Data Structure (5/6)
- Chapter 48. Quad Tree Data Structure (6/6)
- Chapter 49. Tagged Collection ADTs (1/8)
- Chapter 49. Tagged Collection ADTs (2/8)
- Chapter 49. Tagged Collection ADTs (3/8)
- Chapter 49. Tagged Collection ADTs (4/8)
- Chapter 49. Tagged Collection ADTs (5/8)
- Chapter 49. Tagged Collection ADTs (6/8)
- Chapter 49. Tagged Collection ADTs (7/8)
- Chapter 49. Tagged Collection ADTs (8/8)
- Chapter 50. Tagged Bucket Collection ADTs (1/3)
- Chapter 50. Tagged Bucket Collection ADTs (2/3)
- Chapter 50. Tagged Bucket Collection ADTs (3/3)
- Part III. GRAPH DATA STRUCTURES AND ALGORITHMS
- Chapter 51. Part III Organization
- Chapter 52. Graph ADT (1/3)
- Chapter 52. Graph ADT (2/3)
- Chapter 52. Graph ADT (3/3)
- Chapter 53. Abstract Graph and Graph Algorithms (1/6)
- Chapter 53. Abstract Graph and Graph Algorithms (2/6)
- Chapter 53. Abstract Graph and Graph Algorithms (3/6)
- Chapter 53. Abstract Graph and Graph Algorithms (4/6)
- Chapter 53. Abstract Graph and Graph Algorithms (5/6)
- Chapter 53. Abstract Graph and Graph Algorithms (6/6)
- Chapter 54. Adjacency Matrix Data Structure (1/4)
- Chapter 54. Adjacency Matrix Data Structure (2/4)
- Chapter 54. Adjacency Matrix Data Structure (3/4)
- Chapter 54. Adjacency Matrix Data Structure (4/4)
- Chapter 55. Adjacency List Data Structure (1/4)
- Chapter 55. Adjacency List Data Structure (2/4)
- Chapter 55. Adjacency List Data Structure (3/4)
- Chapter 55. Adjacency List Data Structure (4/4)
- Chapter 56. Weighted Graph ADT (1/2)
- Chapter 56. Weighted Graph ADT (2/2)
- Chapter 57. Abstract Weighted Graph and Weighted Graph Algorithms (1/7)
- Chapter 57. Abstract Weighted Graph and Weighted Graph Algorithms (2/7)
- Chapter 57. Abstract Weighted Graph and Weighted Graph Algorithms (3/7)
- Chapter 57. Abstract Weighted Graph and Weighted Graph Algorithms (4/7)
- Chapter 57. Abstract Weighted Graph and Weighted Graph Algorithms (5/7)
- Chapter 57. Abstract Weighted Graph and Weighted Graph Algorithms (6/7)
- Chapter 57. Abstract Weighted Graph and Weighted Graph Algorithms (7/7)
- Part IV. APPENDICES
- Appendix A (1/4)
- Appendix A (2/4)
- Appendix A (3/4)
- Appendix A (4/4)
- Appendix B (1/3)
- Appendix B (2/3)
- Appendix B (3/3)
- Appendix C (1/3)
- Appendix C (2/3)
- Appendix C (3/3)
- Index (1/5)
- Index (2/5)
- Index (3/5)
- Index (4/5)
- Index (5/5)
- Back cover
Product information
- Title: A Practical Guide to Data Structures and Algorithms using Java
- Author(s):
- Release date: August 2007
- Publisher(s): Chapman and Hall/CRC
- ISBN: 9781420010336
You might also like
book
Data Structures and Algorithms Using Java
With an accessible writing style and manageable amount of content, Data Structures and Algorithms Using Java …
book
Java 9 Data Structures and Algorithms
Gain a deep understanding of the complexity of data structures and algorithms and discover the right …
book
Beginning Java Data Structures and Algorithms
Though your application serves its purpose, it might not be a high performer. Learn techniques to …
book
Hands-On Data Structures and Algorithms with Rust
Design and implement professional level programs by exploring modern data structures and algorithms in Rust. Key …