Programmer's Companion to Algorithm Analysis
Regular price
€89.99
14 days return policy
Shipping & Delivery
A01=Ernst L. Leiss
algorithm engineering
Author_Ernst L. Leiss
Average Time Complexity
AVL Tree
Binary Search
Block Transfers
case
Category=UM
complexity
computational theory
Context Free Grammars
Dynamic Data Structures
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Exception Handling
In-core Version
Linear List
main
Main Memory
management
memory
memory hierarchy impact
NP-completeness problems
Optimizing Compilers
programing
Programming Language
Recursive Call
Search Tree
software performance analysis
Sorted Array
space
Space Complexity
Tail Recursion
time
Time Complexity
translating algorithms to code
undecidability in computing
Violated
virtual
Virtual Memory Management
Word Complexity
worst
Worst Case Complexity
Worst Case Computational Complexity
Worst Case Space Complexity
Worst Case Time Complexity
Product details
- ISBN 9781584886730
- Weight: 385g
- Dimensions: 156 x 234mm
- Publication Date: 26 Sep 2006
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Paperback
Secure
checkout
Fast Shipping
Easy returns
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.
