---
product_id: 455581835
title: "Addison Wesley Art of Computer Programming, The, Volumes 1-4B, Boxed Set"
price: "84519 kr"
currency: ISK
in_stock: true
reviews_count: 5
url: https://www.desertcart.is/products/455581835-addison-wesley-art-of-computer-programming-the-volumes-1-4b
store_origin: IS
region: Iceland
---

# Addison Wesley Art of Computer Programming, The, Volumes 1-4B, Boxed Set

**Price:** 84519 kr
**Availability:** ✅ In Stock

## Quick Answers

- **What is this?** Addison Wesley Art of Computer Programming, The, Volumes 1-4B, Boxed Set
- **How much does it cost?** 84519 kr with free shipping
- **Is it available?** Yes, in stock and ready to ship
- **Where can I buy it?** [www.desertcart.is](https://www.desertcart.is/products/455581835-addison-wesley-art-of-computer-programming-the-volumes-1-4b)

## 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 Addison Wesley Art of Computer Programming, The, Volumes 1-4B, Boxed Set by Knuth, Donald online on desertcart.ae at best prices. ✓ Fast and free shipping ✓ free returns ✓ cash on delivery available on eligible purchase.

Review: I ordered this book last September for a really good deal of €70. At that price, it is an amazing value for money. The book itself is not a lite read, so it sits on my bookshelf for one day when I need it.
Review: I have always wanted to have these books, and it was only the fact that when the new box set (1-4B) was on desertcart at a *very* good price that I could justify buying it! I won't say what the price was when I pre-ordered, but it was a *lot* cheaper than the £200+ currently being charged! I was at University studying for my Computer Science Degree in the late 80s, and this was a reference book that myself and my fellow CS Undergraduates referred to very often - it was a reference book that could only be used within the library itself, it couldn't be removed! Be warned - as you can see from the images I've included, a certain level of mathematics and programming knowledge is required. I've included the complete algorithm for a Quicksort, and at the end you can see the start of the MIX program for this algorithm. MIX is Knuth's hypothetical computer, with the language used being a machine language. As noted in Vol 1, MIX is considered out of date, and a new version (MMIX, MIX 2009) has been developed, and will be used in the next edition of volumes 1-3 (Vols 4a and 4b already use MMIX). Volume 1: "Fundamental Algorithms" (originally published in 1968, updated and revised 3rd edition 1997 - Mathematical Preliminaries - MIX - Information Structures (Lists, Trees, Multilinked Structures, Dynamic Storage Allocations) Volume 2: "Seminumerical Algorithms" (originally published in 1969, updated and revised 3rd edition 1998) - Random Numbers - Arithmetic (Positional Number Systems, Floating Point Arithmetic, Multiple-Precision Arithmetic, Radix Conversion, Rational Arithmetic, Polynomial Arithmetic, Manipulation of Power Series) Volume 3: "Sorting and Searching" (originally published in 1973, updated and revised 2nd edition 1998) - Sorting (Combinatorial Properties of Permutations, Internal Sorting, Optimum Sorting, External Sorting) - Searching (Sequential Searching, Searching by Comparison of Keys, Digital Searching, Hashing, Retrieval on Secondary Keys) Volume 4a: "Combinatorial Algorithms Part 1" (originally published in 2011, first edition) - Combinatorial Serarching (Zeros and Ones, Generating All Possibilities) Volume 4b: "Combinatorial Algorithms Part 2" (new publication, first edition 2023) - Mathematical Preliminaries Redux - Combinatorial Searching (Generating All Possibilities continued - backtrack programming and satisfiability) If you are a programmer, this is the go-to work for algorithms! Forthcoming in the next few years (hopefully) are: - Volumes 4C, 4D: Combinatorial Algorithms ( Generating all possibilities (continued), Shortest paths, Graph algorithms, Graphs and optimization, Independence theory, Independence structures, Efficient matroid algorithms, Discrete dynamic programming, Branch-and-bound techniques, Herculean tasks (aka NP-hard problems), Near-optimization), Recursion [This will complete Knuth's "Core" work] The remaining Volumes are planned for, and form specialist areas, so not part of the "Core" work: - Volume 5 – Syntactic Algorithms (Lexical scanning (includes also string search and data compression), Parsing techniques) - Volume 6 – The Theory of Context-free Languages - Volume 7 – Compiler Techniques

## Technical Specifications

| Specification | Value |
|---------------|-------|
| Best Sellers Rank | #94,795 in Books ( See Top 100 in Books ) #55 in Programming Algorithms #36,310 in Textbooks & Study Guides |
| Customer reviews | 4.7 4.7 out of 5 stars (206) |
| Dimensions  | 23.88 x 17.78 x 25.15 cm |
| Edition  | 1st |
| ISBN-10  | 0137935102 |
| ISBN-13  | 978-0137935109 |
| Item weight  | 6.8 Kilograms |
| Language  | English |
| Print length  | 736 pages |
| Publication date  | 18 January 2023 |
| Publisher  | Addison-Wesley Professional |

## Images

![Addison Wesley Art of Computer Programming, The, Volumes 1-4B, Boxed Set - Image 1](https://m.media-amazon.com/images/I/719SYGJejmL.jpg)

## Customer Reviews

### ⭐⭐⭐⭐⭐ Review
*by S***H on 25 February 2023*

I ordered this book last September for a really good deal of €70. At that price, it is an amazing value for money. The book itself is not a lite read, so it sits on my bookshelf for one day when I need it.

### ⭐⭐⭐⭐⭐ Review
*by S***T on 20 January 2023*

I have always wanted to have these books, and it was only the fact that when the new box set (1-4B) was on Amazon at a *very* good price that I could justify buying it! I won't say what the price was when I pre-ordered, but it was a *lot* cheaper than the £200+ currently being charged! I was at University studying for my Computer Science Degree in the late 80s, and this was a reference book that myself and my fellow CS Undergraduates referred to very often - it was a reference book that could only be used within the library itself, it couldn't be removed! Be warned - as you can see from the images I've included, a certain level of mathematics and programming knowledge is required. I've included the complete algorithm for a Quicksort, and at the end you can see the start of the MIX program for this algorithm. MIX is Knuth's hypothetical computer, with the language used being a machine language. As noted in Vol 1, MIX is considered out of date, and a new version (MMIX, MIX 2009) has been developed, and will be used in the next edition of volumes 1-3 (Vols 4a and 4b already use MMIX). Volume 1: "Fundamental Algorithms" (originally published in 1968, updated and revised 3rd edition 1997 - Mathematical Preliminaries - MIX - Information Structures (Lists, Trees, Multilinked Structures, Dynamic Storage Allocations) Volume 2: "Seminumerical Algorithms" (originally published in 1969, updated and revised 3rd edition 1998) - Random Numbers - Arithmetic (Positional Number Systems, Floating Point Arithmetic, Multiple-Precision Arithmetic, Radix Conversion, Rational Arithmetic, Polynomial Arithmetic, Manipulation of Power Series) Volume 3: "Sorting and Searching" (originally published in 1973, updated and revised 2nd edition 1998) - Sorting (Combinatorial Properties of Permutations, Internal Sorting, Optimum Sorting, External Sorting) - Searching (Sequential Searching, Searching by Comparison of Keys, Digital Searching, Hashing, Retrieval on Secondary Keys) Volume 4a: "Combinatorial Algorithms Part 1" (originally published in 2011, first edition) - Combinatorial Serarching (Zeros and Ones, Generating All Possibilities) Volume 4b: "Combinatorial Algorithms Part 2" (new publication, first edition 2023) - Mathematical Preliminaries Redux - Combinatorial Searching (Generating All Possibilities continued - backtrack programming and satisfiability) If you are a programmer, this is the go-to work for algorithms! Forthcoming in the next few years (hopefully) are: - Volumes 4C, 4D: Combinatorial Algorithms ( Generating all possibilities (continued), Shortest paths, Graph algorithms, Graphs and optimization, Independence theory, Independence structures, Efficient matroid algorithms, Discrete dynamic programming, Branch-and-bound techniques, Herculean tasks (aka NP-hard problems), Near-optimization), Recursion [This will complete Knuth's "Core" work] The remaining Volumes are planned for, and form specialist areas, so not part of the "Core" work: - Volume 5 – Syntactic Algorithms (Lexical scanning (includes also string search and data compression), Parsing techniques) - Volume 6 – The Theory of Context-free Languages - Volume 7 – Compiler Techniques

### ⭐⭐⭐⭐⭐ Review
*by M***A on 24 June 2024*

Sem comentários, uma obra essencial para qualquer profissional e acadêmico da área. Um detalhe que vale comentar é que essa versão possui contracapa, eu particularmente não gosto muito, mas para os compradores de plantão, é um ponto a se observar.

## Frequently Bought Together

- Art of Computer Programming, The, Volumes 1-4B, Boxed Set (Art of Computer Programming, 1-4)
- Introduction to Algorithms, fourth edition
- Concrete Mathematics: A Foundation for Computer Science (2nd Edition)

---

## 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.is/products/455581835-addison-wesley-art-of-computer-programming-the-volumes-1-4b](https://www.desertcart.is/products/455581835-addison-wesley-art-of-computer-programming-the-volumes-1-4b)

---

*Product available on Desertcart Iceland*
*Store origin: IS*
*Last updated: 2026-02-10*