|
|
Message from Dean - May 8th 2007
I am currently testing out a new version of the APF Bridge Component - If you notice any errors within this demo store please drop me a line.
List Price: $55.95Amazon.com's Price: $47.65 You Save: $8.30 (15%)Prices subject to change.
Availability: Usually ships in 1 to 2 months
This item ships for FREE with Super Saver Shipping.
Binding: Paperback
Dewey Decimal Number: 005.1
EAN: 9781584886730
Edition: 1
ISBN: 1584886730
Label: Chapman & Hall/CRC
Manufacturer: Chapman & Hall/CRC
Number Of Items: 1
Number Of Pages: 255
Publication Date: September 26, 2006
Publisher: Chapman & Hall/CRC
Studio: Chapman & Hall/CRC
Accessories:
Related Items:
Browse for similar items by category:
Editorial Review:
Product Description:
Until now, no other book examined the gap between the theory of algorithms and the production of software programs. Focusing on practical issues, A Programmer's Companion to Algorithm Analysis carefully details the transition from the design and analysis of an algorithm to the resulting software program. Consisting of two main complementary parts, the book emphasizes the concrete aspects of translating an algorithm into software that should perform based on what the algorithm analysis indicated. In the first part, the author describes the idealized universe that algorithm designers inhabit while the second part outlines how this ideal can be adapted to the real world of programming. The book explores analysis techniques, including crossover points, the influence of the memory hierarchy, implications of programming language aspects, such as recursion, and problems arising from excessively high computational complexities of solution methods. It concludes with four appendices that discuss basic algorithms; memory hierarchy, virtual memory management, optimizing compilers, and garbage collection; NP-completeness and higher complexity classes; and undecidability in practical terms. Applying the theory of algorithms to the production of software, A Programmer's Companion to Algorithm Analysis fulfills the needs of software programmers and developers as well as students by showing that with the correct algorithm, you can achieve a functional software program.
Average Rating: 
Rating: -
This book tries to bridge the gap between theoretical complexity of algorithms and their practical implementations. One example (repeated many times in the book) is the row-major vs. column-major matrix data processing example and the surprising (at least to a novice programmer) discrepancy in performance of those two theoretically equivalent algorithms. This is the area the author thinks is lacking rigorous treatment and organized literature.
The book is divided into four parts: The Algorithm Side, The Software Side,The Conclusion and the appendices. Each chapter ends with bibliographical notes and exercises.
The first part is an introduction to algorithm complexity. There are some really interesting examples here but it's not meant to be a replacement to your favorite algorithms book. Being ~100 pages long, it's probably too big for a 250-page book whose main topic is *not* theoretical algorithm analysis.
The second part is what this book is ... Read More
Availability: Usually ships in 1 to 2 months
|
Amazon Store 