--- product_id: 396402820 title: "Competitive Programming in Python: 128 Algorithms to Develop your Coding Skills" price: "15061F" currency: XPF in_stock: true reviews_count: 2 url: https://frenchpolynesia.desertcart.com/products/396402820-competitive-programming-in-python-128-algorithms-to-develop-your-coding store_origin: PF region: French Polynesia --- # Competitive Programming in Python: 128 Algorithms to Develop your Coding Skills **Price:** 15061F **Availability:** ✅ In Stock ## Quick Answers - **What is this?** Competitive Programming in Python: 128 Algorithms to Develop your Coding Skills - **How much does it cost?** 15061F with free shipping - **Is it available?** Yes, in stock and ready to ship - **Where can I buy it?** [frenchpolynesia.desertcart.com](https://frenchpolynesia.desertcart.com/products/396402820-competitive-programming-in-python-128-algorithms-to-develop-your-coding) ## Best For - Customers looking for quality international products ## Why This Product - Free international shipping included - Worldwide delivery with tracking - 15-day hassle-free returns ## Description Buy Competitive Programming in Python: 128 Algorithms to Develop your Coding Skills by Dürr, Christoph, Vie, Jill-Jênn, Gibbons, Greg, Gibbons, Danièle online on desertcart.ae at best prices. ✓ Fast and free shipping ✓ free returns ✓ cash on delivery available on eligible purchase. Review: Good read Review: For example, on page 120 when explaining Ahujas algorithm, it incorrectly says "the objective value of C is at least delta" rather than at most. The inequality itself showed literally contradicts what it says. It also lacks a bit in time complexity analysis, for example, not explaining the worst case of Karps algorithm, nor even mentioning iterating over edges and using endpoints rather than directly iterating over vertices and their adjacent vertices to consider edges. It also considers worst case hashing instead of amortization, and sometimes does not elaborate on different statements (no corollaries or examples). Also some missing footnotes, for example, the number 8 in the Flows section, literally has no corresponding footnote. On page 194, it says LCD of x and y instead of GCD (regarding two integers which literally would always have an LCD of 1.) On page 189, the brackets are ordered wrong and lead to an incorrect implementation. These are the flaws so far. However, it is still a really solid book which goes over a wide range of different algorithms, and I have picked up new things. It just could be much better if, when I verified those new things, parts of the text were more accurate and actually type checked. I still recommend this for anyone who loves algorithms, but it could be improved, hopefully in further versions. ## Technical Specifications | Specification | Value | |---------------|-------| | Best Sellers Rank | #204,131 in Books ( See Top 100 in Books ) #110 in Programming Algorithms #347 in Web Programming #518 in Computer Programming Languages | | Customer reviews | 4.3 4.3 out of 5 stars (14) | | Dimensions | 16.99 x 1.52 x 24.41 cm | | Edition | 1st | | ISBN-10 | 1108716822 | | ISBN-13 | 978-1108716826 | | Item weight | 460 g | | Language | English | | Print length | 264 pages | | Publication date | 17 December 2020 | | Publisher | Cambridge University Press | ## Images ![Competitive Programming in Python: 128 Algorithms to Develop your Coding Skills - Image 1](https://m.media-amazon.com/images/I/61OiE97+zsL.jpg) ![Competitive Programming in Python: 128 Algorithms to Develop your Coding Skills - Image 2](https://m.media-amazon.com/images/I/71OTOq8oOdL.jpg) ## Customer Reviews ### ⭐⭐⭐⭐⭐ Review *by A***T on 24 May 2025* Good read ### ⭐⭐⭐ Review *by A***R on 10 May 2025* For example, on page 120 when explaining Ahujas algorithm, it incorrectly says "the objective value of C is at least delta" rather than at most. The inequality itself showed literally contradicts what it says. It also lacks a bit in time complexity analysis, for example, not explaining the worst case of Karps algorithm, nor even mentioning iterating over edges and using endpoints rather than directly iterating over vertices and their adjacent vertices to consider edges. It also considers worst case hashing instead of amortization, and sometimes does not elaborate on different statements (no corollaries or examples). Also some missing footnotes, for example, the number 8 in the Flows section, literally has no corresponding footnote. On page 194, it says LCD of x and y instead of GCD (regarding two integers which literally would always have an LCD of 1.) On page 189, the brackets are ordered wrong and lead to an incorrect implementation. These are the flaws so far. However, it is still a really solid book which goes over a wide range of different algorithms, and I have picked up new things. It just could be much better if, when I verified those new things, parts of the text were more accurate and actually type checked. I still recommend this for anyone who loves algorithms, but it could be improved, hopefully in further versions. ## Frequently Bought Together - Competitive Programming in Python - Guide to Competitive Programming: Learning and Improving Algorithms Through Contests (Undergraduate Topics in Computer Science) - Book 1 --- ## 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://frenchpolynesia.desertcart.com/products/396402820-competitive-programming-in-python-128-algorithms-to-develop-your-coding](https://frenchpolynesia.desertcart.com/products/396402820-competitive-programming-in-python-128-algorithms-to-develop-your-coding) --- *Product available on Desertcart French Polynesia* *Store origin: PF* *Last updated: 2026-05-07*