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

Skip to content

ALGORITHMS IN C, PART 5: GRAPH ALGORITHMS, 3RD EDITION

ALGORITHMS IN C, PART 5: GRAPH ALGORITHMS, 3RD EDITION

ALGORITHMS IN C, PART 5: GRAPH ALGORITHMS, 3RD EDITION
Stock photo: cover may vary

ALGORITHMS IN C, PART 5: GRAPH ALGORITHMS, 3RD EDITION Paperback - 2001 - 3rd Edition

by ROBERT SEDGEWICK

Add to wish list
  • New
  • Paperback
New

Description

PEARSON, 2001. Paperback. New.
Ask the seller a question Add to wish list
A$455.78
A$21.26 Delivery to USA
Standard delivery: 20 to 30 days
More delivery options
Ships from Sanctum Books (Delhi, India)

Details

  • Title ALGORITHMS IN C, PART 5: GRAPH ALGORITHMS, 3RD EDITION
  • Author ROBERT SEDGEWICK
  • Binding Paperback
  • Edition number 3rd
  • Edition 3
  • Condition New
  • Pages 1200
  • Volumes 2
  • Language ENG
  • Publisher PEARSON
  • Publication date 2001
  • Bookseller's Inventory # Adhya-9780201756081
  • ISBN 9780201756081 / 0201756080
  • Weight 4.95 lbs (2.25 kg)
  • Dimensions 9.4 x 7.8 x 2.4 in (23.88 x 19.81 x 6.10 cm)
  • Category Computers - Languages / Programming
  • Library of Congress Catalogue Number 97023418
  • Dewey Decimal Code 005.133
  • Quantity available 500

About Sanctum Books Delhi, India

Biblio member since 2010

We are leading publishers, booksellers, distributors, importers, and exporters. We carry a large selection of books on varied subjects. Do place your valued order or let us know your requirement via email.

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.

Books are shipped by Registered Air Mail or DHL/FedEx/Aramex. Additional shipping charges may be required for multi-volume sets.

Browse books from Sanctum Books

Reader reviews for ALGORITHMS IN C, PART 5: GRAPH ALGORITHMS, 3RD EDITION

From the publisher

Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C, Third Edition, Parts 1-4 and his new Algorithms in C, Third Edition, Part 5. Together, these books are definitive: the most up-to-date and practical algorithms resource available. Sedgewick masterfully blends theory and practice, making Bundle of Algorithms in C, Third Edition an essential resource for computer science researchers, students, and working developers alike. The first book introduces fundamental concepts associated with algorithms; then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. Together, these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs. In both books, Sedgewick focuses on practical applications, giving readers all the information, diagrams, and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he presents.

From the rear cover

Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms for C. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C, Third Edition, Parts 1-4 and his new Algorithms in C, Third Edition, Part 5, at a special discounted price. Together, these books are the most definitive, up-to-date, and practical algorithms resource available. The first book introduces fundamental concepts associated with algorithms, then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. Sedgewick focuses on practical applications, giving readers all the information, diagrams, and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he presents. Together these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs.

0201756080B07112001

About the author

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.

0201756080AB06262002

tracking-