The Good, the Bad, and the Hungry Sale
 
 

Recently Viewed clear list


Original Essays | June 20, 2014

Lisa Howorth: IMG So Many Books, So Many Writers



I'm not a bookseller, but I'm married to one, and Square Books is a family. And we all know about families and how hard it is to disassociate... Continue »

spacer

On Order

$113.25
New Trade Paper
Currently out of stock.
Add to Wishlist
available for shipping or prepaid pickup only
Qty Store Section
- Local Warehouse Computer Languages- C

This title in other editions

Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms

by

Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms Cover

 

Synopses & Reviews

Publisher Comments:

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

Synopsis:

This text aims to provide an introduction to graph algorithms and data structures and an understanding of the basic properties of a broad range of fundamental graph algorithms. It is suitable for anyone with some basic programming concepts.

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

Product Details

ISBN:
9780201756081
Author:
Sedgewick, Robert
Publisher:
Addison-Wesley Professional
Subject:
Computer Science
Subject:
Programming Languages - C
Subject:
Programming - General
Subject:
Computer Languages-C++
Copyright:
Edition Number:
3
Publication Date:
August 2001
Binding:
TRADE PAPER
Grade Level:
Professional and scholarly
Language:
English
Pages:
1200
Dimensions:
9.3 x 7.9 x 1.8 in 1905 gr

Related Subjects

Computers and Internet » Computer Languages » C
Computers and Internet » Computers Reference » General
Computers and Internet » Personal Computers » General
Computers and Internet » Software Engineering » Programming and Languages

Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms New Trade Paper
0 stars - 0 reviews
$113.25 Backorder
Product details 1200 pages Addison-Wesley Professional - English 9780201756081 Reviews:
"Synopsis" by , This text aims to provide an introduction to graph algorithms and data structures and an understanding of the basic properties of a broad range of fundamental graph algorithms. It is suitable for anyone with some basic programming concepts.
spacer
spacer
  • back to top
Follow us on...




Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.