---
product_id: 93247194
title: "Problem Solving with Algorithms and Data Structures Using Python 2nd Edition"
price: "€ 188.64"
currency: EUR
in_stock: true
reviews_count: 7
url: https://frenchguiana.desertcart.com/products/93247194-problem-solving-with-algorithms-and-data-structures-using-python-2nd
store_origin: GF
region: French Guiana
---

# Python-based learning Big-O algorithm analysis Beginner-friendly CS textbook Problem Solving with Algorithms and Data Structures Using Python 2nd Edition

**Price:** € 188.64
**Availability:** ✅ In Stock

## Summary

> 🐍 Crack the Code: Elevate your problem-solving skills with Python-powered algorithms!

## Quick Answers

- **What is this?** Problem Solving with Algorithms and Data Structures Using Python 2nd Edition
- **How much does it cost?** € 188.64 with free shipping
- **Is it available?** Yes, in stock and ready to ship
- **Where can I buy it?** [frenchguiana.desertcart.com](https://frenchguiana.desertcart.com/products/93247194-problem-solving-with-algorithms-and-data-structures-using-python-2nd)

## Best For

- Customers looking for quality international products

## Why This Product

- Free international shipping included
- Worldwide delivery with tracking
- 15-day hassle-free returns

## Key Features

- • **Step Up Your CS Game:** Designed for beginners ready to tackle the second course in computer science, bridging the gap to advanced topics.
- • **Practice Makes Perfect:** Multiple problem solutions and timed experiments reinforce learning and build real-world coding intuition.
- • **Learn Python the Smart Way:** Uses Python to simplify complex concepts, making problem solving accessible without overwhelming syntax.
- • **Master Algorithms with Confidence:** Deliberate, incremental exposure to core data structures and algorithms ensures you build a rock-solid foundation.
- • **Understand Performance Like a Pro:** Early and consistent introduction to Big-O notation sharpens your ability to analyze algorithm efficiency.

## Overview

This textbook offers a beginner-friendly, Python-based introduction to algorithms and data structures, emphasizing problem solving and algorithm analysis with Big-O notation. Ideal for second-course computer science students, it provides multiple solutions and practical exercises to build confidence and mastery in foundational CS concepts.

## Description

THIS TEXTBOOK is about computer science. It is also about Python. However, there is much more. The study of algorithms and data structures is central to understanding what computer science is all about. Learning computer science is not unlike learning any other type of difficult subject matter. The only way to be successful is through deliberate and incremental exposure to the fundamental ideas. A beginning computer scientist needs practice so that there is a thorough understanding before continuing on to the more complex parts of the curriculum. In addition, a beginner needs to be given the opportunity to be successful and gain confidence. This textbook is designed to serve as a text for a first course on data structures and algorithms, typically taught as the second course in the computer science curriculum. Even though the second course is considered more advanced than the first course, this book assumes you are beginners at this level. You may still be struggling with some of the basic ideas and skills from a first computer science course and yet be ready to further explore the discipline and continue to practice problem solving. We cover abstract data types and data structures, writing algorithms, and solving problems. We look at a number of data structures and solve classic problems that arise. The tools and techniques that you learn here will be applied over and over as you continue your study of computer science. This textbook has three key features: A strong focus on problem solving introduces students to the fundamental data structures and algorithms by providing a very readable text without introducing an overwhelming amount of new language syntax. Algorithm analysis in terms of Big-O running time is introduced early and applied throughout. Python is used to facilitate the success of beginning students in using and mastering data structures and algorithms.

Review: Great book - Excellent book. Well laid out.
Review: could have been a lot better - Pros: * It is free on [...] * One of the very few books on data structures and algorithms using Python * Problems have multiple solutions, which are timed and discussed in terms of complexity/cost * Experiments a made to prove that a given type has certain time complexity Cons: * The naming of variables and functions follows Java's style, not Python's style. The correct style is on [...] That teaches newbies the wrong habit and annoys experienced Python developers. * Big-O notation is defined incorrectly as "Order of magnitude" and called "a useful approximation to the actual number of steps in the computation" in the chapter on Algorithm Analysis. See wikipedia for a correct definition. You can't be teaching algo analysis and give a wrong definition of Big-O. * Recursion is defined incorrectly - "Recursion is a method of solving problems that involves breaking a problem down into smaller and smaller subproblems until you get to a small enough problem that it can be solved trivially". The above describes "divide and conquer", not "recursion". * Class definitions follow the syntax for "old-style" classes. Everyone moved to "new-style" classes a long time ago. * Sometimes even their "best" solution is not very good and/or does not take advantage of existing Python functionality. For example the Anagram Detection Example in the chapter on Algorithm Analysis - the last solution is counting the number of character occurrences by looping. This is inefficient. Just use collections.Counter Overall it's an OK intro, but not particularly in-depth and the Cons I've listed are serious drawbacks imho.

## Features

- Problem Solving with Algorithms and Data Structures Using Python
- Brand: Franklin Beedle Associates
- Product type: ABIS BOOK
- Language: English

## Technical Specifications

| Specification | Value |
|---------------|-------|
| Best Sellers Rank | 774,369 in Books ( See Top 100 in Books ) 1,049 in Introduction to Programming |
| Customer Reviews | 4.6 out of 5 stars 162 Reviews |

## Images

![Problem Solving with Algorithms and Data Structures Using Python 2nd Edition - Image 1](https://m.media-amazon.com/images/I/61y805lj-ZL.jpg)

## Customer Reviews

### ⭐⭐⭐⭐⭐ Great book
*by A***T on 5 August 2025*

Excellent book. Well laid out.

### ⭐⭐⭐ could have been a lot better
*by I***T on 19 October 2013*

Pros: * It is free on [...] * One of the very few books on data structures and algorithms using Python * Problems have multiple solutions, which are timed and discussed in terms of complexity/cost * Experiments a made to prove that a given type has certain time complexity Cons: * The naming of variables and functions follows Java's style, not Python's style. The correct style is on [...] That teaches newbies the wrong habit and annoys experienced Python developers. * Big-O notation is defined incorrectly as "Order of magnitude" and called "a useful approximation to the actual number of steps in the computation" in the chapter on Algorithm Analysis. See wikipedia for a correct definition. You can't be teaching algo analysis and give a wrong definition of Big-O. * Recursion is defined incorrectly - "Recursion is a method of solving problems that involves breaking a problem down into smaller and smaller subproblems until you get to a small enough problem that it can be solved trivially". The above describes "divide and conquer", not "recursion". * Class definitions follow the syntax for "old-style" classes. Everyone moved to "new-style" classes a long time ago. * Sometimes even their "best" solution is not very good and/or does not take advantage of existing Python functionality. For example the Anagram Detection Example in the chapter on Algorithm Analysis - the last solution is counting the number of character occurrences by looping. This is inefficient. Just use collections.Counter Overall it's an OK intro, but not particularly in-depth and the Cons I've listed are serious drawbacks imho.

### ⭐ Ended ordering another data structure and algorithm book from a different author
*by A***R on 13 June 2022*

I did not enjoy the book at all but i decided to not be picky. The i encountered a couple of code issues. But what makes buy another data structure and algorithm book was that the physical quality of the book. It is really hard to keep it open in order to make your hands free to code. Stupid paper material and book size

## Frequently Bought Together

- Problem Solving with Algorithms and Data Structures Using Python 2nd Edition
- Data Structures and Problem Solving Using Java
- The Hitchhiker's Guide to Python: Best Practices for Development

---

## Why Shop on Desertcart?

- 🛒 **Trusted by 1.3+ Million Shoppers** — Serving international shoppers since 2016
- 🌍 **Shop Globally** — Access 737+ million products across 21 categories
- 💰 **No Hidden Fees** — All customs, duties, and taxes included in the price
- 🔄 **15-Day Free Returns** — Hassle-free returns (30 days for PRO members)
- 🔒 **Secure Payments** — Trusted payment options with buyer protection
- ⭐ **TrustPilot Rated 4.5/5** — Based on 8,000+ happy customer reviews

**Shop now:** [https://frenchguiana.desertcart.com/products/93247194-problem-solving-with-algorithms-and-data-structures-using-python-2nd](https://frenchguiana.desertcart.com/products/93247194-problem-solving-with-algorithms-and-data-structures-using-python-2nd)

---

*Product available on Desertcart French Guiana*
*Store origin: GF*
*Last updated: 2026-08-26*