Python Data Structures and Algorithms

By : Benjamin Baka

2.7 (11)

Buy this Book

Python Data Structures and Algorithms

2.7 (11)

By: Benjamin Baka

Buy this Book

Overview of this book

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.

Preface

What this book covers

What you need for this book

Who this book is for

Conventions

Reader feedback

Customer support

Free Chapter

Python Objects, Types, and Expressions

Understanding data structures and algorithms

Python for data

Summary

Python Data Types and Structures

Operations and expressions

Built-in data types

Sets

Modules for data structures and algorithms

Summary

Principles of Algorithm Design

Algorithm design paradigms

Recursion and backtracking

Runtime analysis

Amortized analysis

Summary

Lists and Pointer Structures

Arrays

Pointer structures

Nodes

Finding endpoints

Singly linked lists

A faster append operation

Getting the size of the list

Improving list traversal

Deleting nodes

Clearing a list

Doubly linked lists

Circular lists

Summary

Stacks and Queues

Stacks

Queues

Summary

Trees

Terminology

Tree nodes

Binary trees

Summary

Hashing and Symbol Tables

Hashing

Hash table

Summary

Graphs and Other Algorithms

Graphs

Directed and undirected graphs

Weighted graphs

Graph representation

Graph traversal

Other useful graph methods

Priority queues and heaps

Selection algorithms

Summary

Searching

Linear Search

Binary search

Interpolation search

Summary

Sorting

Sorting algorithms

Bubble sort

Insertion sort

Selection sort

Quick sort

Summary

Selection Algorithms

Selection by sorting

Randomized selection

Deterministic selection

Summary

Design Techniques and Strategies

Classification of algorithms

Technical implementation

Complexity classes

Summary

Implementations, Applications, and Tools

Tools of the trade

Data preprocessing

Machine learning

Data visualization

Summary

Customer Reviews

2.7 (11)

5 star

27.3%

4 star

9.1%

3 star

9.1%

2 star

18.2%

1 star

36.4%

Stacks and Queues

In this chapter, we are going to build upon the skills we learned in the last chapter in order to create special list implementations. We are still sticking to linear structures. We will get to more complex data structures in the coming chapters.

In this chapter, we are going to look at the following: