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

Skip to content

Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures

Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures

Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures
Stock photo: cover may vary

Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures Paperback - 2018

by Roughgarden, Tim

Add to wish list
  • Used
  • Good
  • Paperback
Used - Good

Description

Soundlikeyourself Publishing, LLC, 2018-08-05. paperback. Good. 6x0x9. Textbook, May Have Highlights, Notes and/or Underlining, BOOK ONLY-NO ACCESS CODE, NO CD, Ships with Tracking
Ask the seller a question Add to wish list
A$66.41
A$5.64 Delivery within USA
Standard delivery: 4 to 14 days
More delivery options
Ships from SGS Trading Inc (New Jersey, United States)

Details

About SGS Trading Inc New Jersey, United States

Specialising in: Reference Books, Textbook
Biblio member since 2009

Textbook and Reference Books Discounted

Terms of Sale: 30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from SGS Trading Inc

Reader reviews for Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures

From the publisher

Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons. Part 2 covers graph search and applications, shortest paths, and the usage and implementation of several data structures (heaps, search trees, hash tables, and bloom filters).

tracking-