Algorithims in C (Computer Science Ser) - Hardcover

Sedgewick, Robert

Hardcover

ISBN 10: 0201514257 ISBN 13: 9780201514254

Publisher: Addison Wesley, 1990

Synopsis

This new version of the best-selling book, Algorithms, SecondEdition, provides a comprehensive collection of algorithmsimplemented in C. A variety of algorithms are described in eachofthe following areas: sorting, searching, string-processing,geometric, graph, and mathematical algorithms. These algorithmsare expressed in terms of concise implementations in C, so thatreaders can both appreciate their fundamental properties and testthem on real applications. The treatment of analysis of algorithms is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are preferred, and in some cases, therelationship of the practical algorithms being disussed to purelytheoretical results is also described. Features *Hundreds of detailed, innovative figures clearly demonstratehow important algorithms work. *Throughout the book, "properties" sections encapsulatespecific information on the performance characteristics ofalgorithms. *Six chapters present fundamental concepts, including a briefintroduction to data structures. Algorithms in C provides readers with the tools to confidentlyimplement, run, and debug useful algorithms. This book may beuseful for self-study, or as a reference for people engaged inthe development of computer systems for applications programs. 0201514257B04062001

About this title

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.

0201514257AB06262002

From the Back Cover

This new version of the best-selling book, Algorithms, SecondEdition, provides a comprehensive collection of algorithmsimplemented in C. A variety of algorithms are described in eachofthe following areas: sorting, searching, string-processing,geometric, graph, and mathematical algorithms. These algorithmsare expressed in terms of concise implementations in C, so thatreaders can both appreciate their fundamental properties and testthem on real applications.

The treatment of analysis of algorithms is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are preferred, and in some cases, therelationship of the practical algorithms being disussed to purelytheoretical results is also described.

Features

• Hundreds of detailed, innovative figures clearly demonstratehow important algorithms work.
• Throughout the book, "properties" sections encapsulatespecific information on the performance characteristics ofalgorithms.
• Six chapters present fundamental concepts, including a briefintroduction to data structures.

Algorithms in C provides readers with the tools to confidentlyimplement, run, and debug useful algorithms. This book may beuseful for self-study, or as a reference for people engaged inthe development of computer systems for applications programs.

0201514257B04062001

Edition details

• Publisher: Addison Wesley
• Publication date: 1990
• Language: English
• ISBN 10: 0201514257
• ISBN 13: 9780201514254
• Binding: Hardcover
• Edition number: 1
• Number of pages: 672