Programmer's Companion to Algorithm Analysis, A
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 softwar...
Đã lưu trong:
| Tác giả chính: | |
|---|---|
| Định dạng: | Sách |
| Ngôn ngữ: | English |
| Được phát hành: |
CRC Press
2009
|
| Truy cập trực tuyến: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/1485 |
| Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
| id |
oai:scholar.dlu.edu.vn:DLU123456789-1485 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scholar.dlu.edu.vn:DLU123456789-14852009-12-03T07:57:41Z Programmer's Companion to Algorithm Analysis, A Leiss, Ernst 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. PART 1 THE ALGORITHM SIDE: REGULARITY, PREDICTABILITY, AND ASYMPTOTICS A Taxonomy of Algorithmic Complexity Fundamental Assumptions Underlying Algorithmic Complexity Examples of Complexity Analysis PART 2 THE SOFTWARE SIDE: DISAPPOINTMENTS AND HOW TO AVOID THEM Sources of Disappointments Implications of Nonuniform Memory for Software Implications of Compiler and Systems Issues for Software Implicit Assumptions Implications of the Finiteness of the Representation of Numbers Asymptotic Complexities and the Selection of Algorithms Infeasibility and Undecidability: Implications for Software Development PART 3 CONCLUSION Appendix I: Algorithms Every Programmer Should Know Appendix II: Overview of Systems Implicated in Program Analysis Appendix III: NP-Completeness and Higher Complexity Classes Appendix IV: Review of Undecidability BIBLIOGRAPHY INDEX 2009-12-03T07:57:41Z 2009-12-03T07:57:41Z 2006 Book https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/1485 en application/rar CRC Press |
| institution |
Thư viện Trường Đại học Đà Lạt |
| collection |
Thư viện số |
| language |
English |
| 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. |
| format |
Book |
| author |
Leiss, Ernst |
| spellingShingle |
Leiss, Ernst Programmer's Companion to Algorithm Analysis, A |
| author_facet |
Leiss, Ernst |
| author_sort |
Leiss, Ernst |
| title |
Programmer's Companion to Algorithm Analysis, A |
| title_short |
Programmer's Companion to Algorithm Analysis, A |
| title_full |
Programmer's Companion to Algorithm Analysis, A |
| title_fullStr |
Programmer's Companion to Algorithm Analysis, A |
| title_full_unstemmed |
Programmer's Companion to Algorithm Analysis, A |
| title_sort |
programmer's companion to algorithm analysis, a |
| publisher |
CRC Press |
| publishDate |
2009 |
| url |
https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/1485 |
| _version_ |
1819767946636951552 |