0%

LEARN HOW TO USE DATA STRUCTURES IN WRITING HIGH PERFORMANCE PYTHON PROGRAMS AND ALGORITHMS

This practical introduction to data structures and algorithms can help every programmer who wants to write more efficient software. Building on Robert Lafores legendary Java-based guide, this book helps you understand exactly how data structures and algorithms operate. Youll learn how to efficiently apply them with the enormously popular Python language and scale your code to handle todays big data challenges.

Throughout, the authors focus on real-world examples, communicate key ideas with intuitive, interactive visualizations, and limit complexity and math to what you need to improve performance. Step-by-step, they introduce arrays, sorting, stacks, queues, linked lists, recursion, binary trees, 2-3-4 trees, hash tables, spatial data structures, graphs, and more. Their code examples and illustrations are so clear, you can understand them even if youre a near-beginner, or your experience is with other procedural or object-oriented languages.

  • Build core computer science skills that take you beyond merely writing code

  • Learn how data structures make programs (and programmers) more efficient

  • See how data organization and algorithms affect how much you can do with todays, and tomorrows, computing resources

  • Develop data structure implementation skills you can use in any language

  • Choose the best data structure(s) and algorithms for each programming problemand recognize which ones to avoid

Data Structures & Algorithms in Python is packed with examples, review questions, individual and team exercises, thought experiments, and longer programming projects. It’s ideal for both self-study and classroom settings, and either as a primary text or as a complement to a more formal presentation.

Table of Contents

  1. Cover Page
  2. About This eBook
  3. Title Page
  4. Copyright Page
  5. Contents at a Glance
  6. Table of Contents
  7. Pearson’s Commitment to Diversity, Equity, and Inclusion
  8. Dedication Page
  9. Acknowledgments
  10. Acknowledgments to the First Edition, Data Structures and Algorithms in Java
  11. Acknowledgments to the Second Edition
  12. About the Authors
  13. Introduction
  14. Figure Credits
  15. Chapter 1. Overview
  16. Chapter 2. Arrays
  17. Chapter 3. Simple Sorting
  18. Chapter 4. Stacks and Queues
  19. Chapter 5. Linked Lists
  20. Chapter 6. Recursion
  21. Chapter 7. Advanced Sorting
  22. Chapter 8. Binary Trees
  23. Chapter 9. 2-3-4 Trees and External Storage
  24. Chapter 10. AVL and Red-Black Trees
  25. Chapter 11. Hash Tables
  26. Chapter 12. Spatial Data Structures
  27. Chapter 13. Heaps
  28. Chapter 14. Graphs
  29. Chapter 15. Weighted Graphs
  30. Chapter 16. What to Use and Why
  31. Appendixes
  32. Index
  33. Code Snippets
3.128.199.210