--- product_id: 185649058 title: "Introduction to Algorithms, Second Edition" price: "AED 366" currency: AED in_stock: true reviews_count: 13 url: https://www.desertcart.ae/products/185649058-introduction-to-algorithms-second-edition store_origin: AE region: United Arab Emirates --- # Introduction to Algorithms, Second Edition **Price:** AED 366 **Availability:** ✅ In Stock ## Quick Answers - **What is this?** Introduction to Algorithms, Second Edition - **How much does it cost?** AED 366 with free shipping - **Is it available?** Yes, in stock and ready to ship - **Where can I buy it?** [www.desertcart.ae](https://www.desertcart.ae/products/185649058-introduction-to-algorithms-second-edition) ## 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 The first edition won the award for Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers. There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning. Review: The best general textbook on computer algorithms ever written. - Written by an MIT professor, this book covers ALL categories of computer algorithms. It is a somewhat challenging textbook for a first course in computer algorithms, but students can keep the book past graduation, and use it as a reference book while they work as professional software engineers. Review: Honestly? I'm disappointed with reviewers... - Giving this book a bad review because: a) you had a bad instructor for the course b) you find the material difficult c) you can't understand pseudo-code are not what I would call constructive or worthwhile critiques of the text of this excellent book. PLEASE society, PLEASE understand that some topics you have to actually WORK at understanding. It won't be spoon fed to you. It seems moreso with Computer Science majors than other majors (I'm an electrical engineer undergrad, comp sci grad student) that they whine and whine and whine about the math or about it being difficult to actually have to work to understand something. Oh my GOODNESS!!!! It's hard? Well, BLAME THE BOOK. Rant over. This book is amazing. It's the bible of algorithms and, to some extent, data structures. If you're not aforementioned whiners, feel free to buy this book, work hard, and learn a lot! There's not a better book out there in my experience. ## Technical Specifications | Specification | Value | |---------------|-------| | Best Sellers Rank | #1,189,097 in Books ( See Top 100 in Books ) #5,350 in Computer Science (Books) #9,740 in Mathematics (Books) | | Customer Reviews | 4.4 out of 5 stars 224 Reviews | ## Images ![Introduction to Algorithms, Second Edition - Image 1](https://m.media-amazon.com/images/I/61O5SsbL8HL.jpg) ## Customer Reviews ### ⭐⭐⭐⭐⭐ The best general textbook on computer algorithms ever written. *by P***E on August 7, 2025* Written by an MIT professor, this book covers ALL categories of computer algorithms. It is a somewhat challenging textbook for a first course in computer algorithms, but students can keep the book past graduation, and use it as a reference book while they work as professional software engineers. ### ⭐⭐⭐⭐⭐ Honestly? I'm disappointed with reviewers... *by R***N on March 13, 2004* Giving this book a bad review because: a) you had a bad instructor for the course b) you find the material difficult c) you can't understand pseudo-code are not what I would call constructive or worthwhile critiques of the text of this excellent book. PLEASE society, PLEASE understand that some topics you have to actually WORK at understanding. It won't be spoon fed to you. It seems moreso with Computer Science majors than other majors (I'm an electrical engineer undergrad, comp sci grad student) that they whine and whine and whine about the math or about it being difficult to actually have to work to understand something. Oh my GOODNESS!!!! It's hard? Well, BLAME THE BOOK. Rant over. This book is amazing. It's the bible of algorithms and, to some extent, data structures. If you're not aforementioned whiners, feel free to buy this book, work hard, and learn a lot! There's not a better book out there in my experience. ### ⭐⭐⭐⭐ Non-bias Review from a C++ programmer. *by J***O on November 9, 2006* Overall this is a good book and well worth every cent. The material is covered better than most data structure text books. It also avoids using recursion in situations when its not needed. For example, the texts chapter on red-black trees is probably the best I've seen. It explains key concepts while building on previous knowledge with notes to where the previous material was covered. The red-black tree is explained without using recursion, because the authors were smart enough to have realized the general reader cares about creating practical data structures without any or much lost in performance. Cormen et al does this well indeed. Each algorithm is laid out in pseudo-code that can easily be adapted to code in any language. One of my dissatisfactions was with the presentation of the pseudocode in that the indentation was done in a strange manner. This made the scope of the blocks of logic in certain algorithms confusing. Furthermore, the binding of the book is quite fragile and would most likely be broken with casual use as a textbook in college. However, I suspect the author did this to lower the price for college students and I thank him for that. In conclusion, this is near perfect book and is the reason why I give it four stars instead of five. If you are seeking a good data structure or algorithm textbook, then you cannot go wrong with Introduction to Algorithms. --- ## 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://www.desertcart.ae/products/185649058-introduction-to-algorithms-second-edition](https://www.desertcart.ae/products/185649058-introduction-to-algorithms-second-edition) --- *Product available on Desertcart United Arab Emirates* *Store origin: AE* *Last updated: 2026-09-05*