Data structures and algorithms in python /
Canning, John
Data structures and algorithms in python / John Canning, Allan Broder and Robert Lafore - Boston : Addison-Wesly c2023 - 886 pages : illustration ; 24cm.
Includes Appendix and Index.
Contents -- 1. Overview -- 2. Arrays. -- 3. Simple sorting -- 4. Stacks and queus -- 5. Linked lists -- 6. Recursion -- 7. Advanced sorting -- 8. Binary trees -- 9. 2-3-4 trees and external storage -- 10. AVL and red-black trees -- 11. Hash tables 12. Spatial -- 13. Heaps -- 14. Graphs -- 15. Weighted Graphs -- 16. What to us and Why.
This practical introduction to data structures and algorithms can help every programmer who wants to write more efficient software. Building on Robert Lefore'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.
978-0-13-485568-4
COMPUTER PROGRAMMING
GC QA 76.73 .P98 .C36 2023 c.1
Data structures and algorithms in python / John Canning, Allan Broder and Robert Lafore - Boston : Addison-Wesly c2023 - 886 pages : illustration ; 24cm.
Includes Appendix and Index.
Contents -- 1. Overview -- 2. Arrays. -- 3. Simple sorting -- 4. Stacks and queus -- 5. Linked lists -- 6. Recursion -- 7. Advanced sorting -- 8. Binary trees -- 9. 2-3-4 trees and external storage -- 10. AVL and red-black trees -- 11. Hash tables 12. Spatial -- 13. Heaps -- 14. Graphs -- 15. Weighted Graphs -- 16. What to us and Why.
This practical introduction to data structures and algorithms can help every programmer who wants to write more efficient software. Building on Robert Lefore'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.
978-0-13-485568-4
COMPUTER PROGRAMMING
GC QA 76.73 .P98 .C36 2023 c.1
