Sign up
Forgot password?
FAQ: Login

Canning J., Broder A., Lafore R. Data Structures & Algorithms in Python

  • zip file
  • size 81,55 MB
  • contains epub document(s)
Canning J., Broder A., Lafore R. Data Structures & Algorithms in Python
Addison-Wesley Professional, 2022. — 928 p. — ISBN13: 978-0134855684.
This practical introduction to data structures and algorithms can help every programmer who wants to write more efficient software. Building on Robert Lafore’s legendary Java-based guide, this book helps you understand exactly how data structures and algorithms operate. You’ll learn how to efficiently apply them with the enormously popular Python language and scale your code to handle today’s 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 you’re 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 today’s, and tomorrow’s, computing resources.
Develop data structure implementation skills you can use in any language.
Choose the best data structure(s) and algorithms for each programming problem — and 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.
Overview.
Arrays.
Simple Sorting.
Stacks and Queues.
Linked Lists.
Recursion.
Advanced Sorting.
Binary Trees.
2-3-4 Trees and External Storage.
AVL and Red-Black Trees.
Hash Tables.
Spatial Data Structures.
Heaps.
Graphs.
Weighted Graphs.
What to Use and Why.
Running the Visualizations.
Further Reading.
Answers to Questions.
  • Sign up or login using form at top of the page to download this file.
  • Sign up
Up