Algorithms
Now Browsing: Textbooks › Algorithms › Algorithms
Published: 2008
Publisher: McGraw-Hill Higher Education
Format: Paperback
Pages: 320
ISBN 13: 9780073523408
ISBN 10: 0073523402
- All
- Rent
- Buy
- eBook
- Sell Back
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Also check: Knetbooks, BiggerBooks
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Also check: BiggerBooks, Knetbooks, AbeBooks
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Also check: Knetbooks, BiggerBooks
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Also check: BiggerBooks, Knetbooks, AbeBooks
Bookstore Condition | Item Price Shipping Total Cost Store link |
|---|---|
Prices checked Oct 20, 2026, 12:20 AM ET. Prices change often; the store's checkout price is final.
Renting vs. Buying This Textbook
Renting is usually cheapest if you only need the book for one term: you return it with a free prepaid label when the term ends. Buying used can beat renting when the sell-back price is high, so compare the sell-back price with the rental price before you decide. An eTextbook arrives instantly but usually expires. Rentals and used copies rarely include working access codes.
Always match the ISBN on your syllabus (9780073523408) before you order; different editions have different ISBNs.
About This Book
This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter…