| 书目名称 | Practical Analysis of Algorithms |
| 编辑 | Dana Vrajitoru,William Knight |
| 视频video | |
| 概述 | Provides highly detailed yet easy to understand explanations and proofs.Presents numerous practical examples throughout the text.Introduces the fundamental mathematics required, described from the poi |
| 丛书名称 | Undergraduate Topics in Computer Science |
| 图书封面 |  |
| 描述 | This book introduces the essential concepts of algorithm analysis required by core undergraduate and graduate computer science courses, in addition to providing a review of the fundamental mathematical notions necessary to understand these concepts. Features: includes numerous fully-worked examples and step-by-step proofs, assuming no strong mathematical background; describes the foundation of the analysis of algorithms theory in terms of the big-Oh, Omega, and Theta notations; examines recurrence relations; discusses the concepts of basic operation, traditional loop counting, and best case and worst case complexities; reviews various algorithms of a probabilistic nature, and uses elements of probability theory to compute the average complexity of algorithms such as Quicksort; introduces a variety of classical finite graph algorithms, together with an analysis of their complexity; provides an appendix on probability theory, reviewing the major definitions and theorems used in the book. |
| 出版日期 | Textbook 2014 |
| 关键词 | Algorithms Analysis; Fundamental Notation; Probabilistic Algorithms; Recurrence Relations; algorithm ana |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-319-09888-3 |
| isbn_softcover | 978-3-319-09887-6 |
| isbn_ebook | 978-3-319-09888-3Series ISSN 1863-7310 Series E-ISSN 2197-1781 |
| issn_series | 1863-7310 |
| copyright | Springer International Publishing Switzerland 2014 |
发表于 2025-3-21 18:36:13
