Algorithms in C (Computer Science Series)
This Description may be from another edition of this product.
The latest addition to Robert Sedgewick's popular series of bookscarries his comprehensive collection of algorithms into anobject-oriented programming (OP) environment with implementationin the C++ programming language. These algorithms cover a broadrange of fundamental and more advanced methods: sorting, searching, string-processing, geometric, graph, and mathematicalalgorithms. The algorithms are all expressed in terms of conciseimplementations in C++, so that readers can both appreciate theirbasic properties and test them on real applications.The treatment of analysis of algorithsm is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are prefered, and in some cases, therelationship of the proactical algorithms being discussed topurely theoretical results is also described. The ultimate aim of the book is to improve programming practice, whatever the environment, whatever the implementation language. Sedgweick describes the basic methods to be considered in everycase. 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 Read More chevron_right
Frequently Asked Questions About Algorithms in C (Computer Science Series)
How long does it take to read Algorithms in C (Computer Science Series)?
It takes about 11 Hours and 35 minutes on average for a reader to read Algorithms in C (Computer Science Series). This is based on the average reading speed of 250 Words per minute.
How long is Algorithms in C (Computer Science Series)?
Algorithms in C (Computer Science Series) is 657 pages long.
- Who wrote Algorithms in C (Computer Science Series)?
Other c books you might enjoy
Book Reviews (0)
No customer reviews for the moment.