BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Algorithms

Algorithms

Algorithms
Stock photo: cover may vary

Algorithms Paperback - 2006 - 1st Edition

by Sanjoy Dasgupta; Christos H. Papadimitriou; Umesh Vazirani

Add to wish list
  • Used
  • Paperback
New

Description

McGraw-Hill Education. Used - Like New. paperback. Text block, wrappers and binding are in like new condition, without markings of any kind. Supporting Bay Area Friends of the Library since 2010. Well packaged and promptly shipped.
Ask the seller a question Add to wish list
A$85.71
A$7.08 Delivery within USA
Standard delivery: 5 to 8 days
More delivery options
Ships from The Book Forest (California, United States)
The BIBLIO Guarantee

Details

  • Title Algorithms
  • Author Sanjoy Dasgupta; Christos H. Papadimitriou; Umesh Vazirani
  • Binding Paperback
  • Edition number 1st
  • Edition 1
  • Condition New
  • Pages 336
  • Volumes 1
  • Language ENG
  • Publisher McGraw-Hill Education, ^^ in Stock: we Ship at Once fr. IL USA;
  • Publication date 2006-09-13
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index, Table of Contents, Textbook
  • Bookseller's Inventory # BAY03-00180
  • ISBN 9780073523408 / 0073523402
  • Weight 1.11 lbs (0.50 kg)
  • Dimensions 9.16 x 7.38 x 0.53 in (23.27 x 18.75 x 1.35 cm)
  • Category Computers - Languages / Programming
  • Library of Congress subjects Algorithms, Computer algorithms
  • Library of Congress Catalogue Number 2006049014
  • Dewey Decimal Code 518.1
  • Quantity available 1

About The Book Forest California, United States

Biblio member since 2006

The Book Forest has been selling books on the internet since 2004, with a 98% customer approval rating on other internet book selling venues. At The Book Forest we never mislead customers on the condition of a book so that we might make a sale, and we ship all our orders within 24 hours of receiving them. We also have a 100% money back guarantee, and we handle questions and concerns within a few hours of receiving them.

Terms of Sale: The Book Forest offers a 100% money back guarantee on all items. If you are all dissatisfied with the timeliness or condition of your order you can return it for a full refund (we submit refund upon receipt of the book). Partial refunds are also given if the customer so chooses. Please note that standard/media mail takes 4-14 business days, while priority takes 2-4.

Browse books from The Book Forest

Reader reviews for Algorithms

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

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 on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center.

"Algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read." Tim Roughgarden Stanford University

Please wait a moment while we load the requested page.

tracking-