Python Data Structures and Algorithms: Improve application performance with graphs, stacks, and queues

Implement classic and functional data structures and algorithms using Python

Key Features

• A step by step guide, which will provide you with a thorough discussion on the analysis and design of fundamental Python data structures.
• Get a better understanding of advanced Python concepts such as big-o notation, dynamic programming, and functional data structures.
• Explore illustrations to present data structures and algorithms, as well as their analysis, in a clear, visual manner.

Book Description

Data structures allow you to organize data in a particular way efficiently. They are critical to any problem, provide a complete solution, and act like reusable code.

In this book, you will learn the essential Python data structures and the most common algorithms.

With this easy-to-read book, you will be able to understand the power of linked lists, double linked lists, and circular linked lists. You will be able to create complex data structures such as graphs, stacks and queues. We will explore the application of binary searches and binary search trees. You will learn the common techniques and structures used in tasks such as preprocessing, modeling, and transforming data. We will also discuss how to organize your code in a manageable, consistent, and extendable way. The book will explore in detail sorting algorithms such as bubble sort, selection sort, insertion sort, and merge sort.

By the end of the book, you will learn how to build components that are easy to understand, debug, and use in different applications.

What you will learn

• Gain a solid understanding of Python data structures.
• Build sophisticated data applications.
• Understand the common programming patterns and algorithms used in Python data science.
• Write efficient robust code.

Table of Contents

1. Python objects, types and expressions
2. Python data types and structures
3. Principles of data structure design
4. Lists and pointer structures
5. Stacks and Queues
6. Trees
7. Hashing and symbol tables
8. Graphs and other algorithms
9. Searching
10. Sorting
11. Selction Algorithms
12. Design Ttechniques and Sstrategies
13. Implementations, applications and tools

Benjamin Baka works as a software developer and has over 10 years, experience in programming. He is a graduate of Kwame Nkrumah University of Science and Technology and a member of the Linux Accra User Group. Notable in his language toolset are C, C++, Java, Python, and Ruby. He has a huge interest in algorithms and finds them a good intellectual exercise.

He is a technology strategist and software engineer at mPedigree Network, weaving together a dizzying array of technologies in combating counterfeiting activities, empowering consumers in Ghana, Nigeria, and Kenya to name a few.

In his spare time, he enjoys playing the bass guitar and listening to silence. You can find him on his blog.