Competitive Programming in Python: 128 Algorithms to Develop your Coding Skills
Product ID: 396402820
Buy anything from 5,000+ international stores. One checkout price. No surprise fees. Join 2M+ shoppers on Desertcart.
Desertcart purchases this item on your behalf and handles shipping, customs, and support to Saint Kitts and Nevis.
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.
| 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 |
A**T
Good read
A**R
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.
Trustpilot
1 month ago
1 month ago