The problems that computer algorithms try to solve fall within a range of difficulty by which their solutions are arrived at. In this section, we will discuss the complexity classes N, NP, NP-complete, and NP-hard problems.
-
Book Overview & Buying
-
Table Of Contents
Python Data Structures and Algorithms
By :
Python Data Structures and Algorithms
By:
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.
Table of Contents (14 chapters)
Preface
Free Chapter
Python Objects, Types, and Expressions
Python Data Types and Structures
Principles of Algorithm Design
Lists and Pointer Structures
Stacks and Queues
Hashing and Symbol Tables
Graphs and Other Algorithms
Selection Algorithms
Design Techniques and Strategies
Implementations, Applications, and Tools
