Название: Algorithms: A Top-Down Approach Автор: Rodney R. Howell Издательство: World Scientific Publishing Год: 2023 Страниц: 611 Язык: английский Формат: pdf (true) Размер: 22.3 MB
This comprehensive compendium provides a rigorous framework to tackle the daunting challenges of designing correct and efficient algorithms. It gives a uniform approach to the design, analysis, optimization, and verification of algorithms. The volume also provides essential tools to understand algorithms and their associated data structures. This useful reference text describes a way of thinking that eases the task of proving algorithm correctness. Working through a proof of correctness reveals an algorithm's subtleties in a way that a typical description does not. Algorithm analysis is presented using careful definitions that make the analyses mathematically rigorous.
This book is motivated in part by the author’s belief that people do not fully understand an algorithm until they are able to prove its correctness. For this reason, all of Chapter 2 and much of Chapter 4 are devoted to techniques for proving correctness. Outside of these two chapters, however, very few correctness proofs are given, as they would needlessly clutter the presentation with tedious details. Instead, all algorithms are presented in such a way as to facilitate a correctness proof. The particular approach used is top-down. This approach fits well with mathematical techniques of induction, proving loop invariants, and applying previously-shown theorems. By having an understanding of the mechanics of proving correctness, readers are equipped to gain a thorough understanding of an algorithm presented in a top-down way.
Algorithms are presented in a pseudo language defined with enough rigor to facilitate both performance analyses and correctness proofs. The essence of an algorithm is not tied to a particular programming language; hence, we have chosen a computational model and corresponding notation that we feel are appropriate for communicating algorithms to humans.
This text contains sufficient material for both an advanced undergraduate course and an introductory graduate-level course on the design and analysis of algorithms.
Prerequisite Material: This book is intended to be reasonably self-contained. However, a certain degree of maturity is assumed regarding the audience. Readers are expected to have enough experience in writing programs so as to be able to understand algorithms presented in a pseudo language. Experience with basic data structures, including stacks, queues, lists, and trees, will be helpful, as will experience in manipulating finite and infinite sums, solving recurrences, and performing combinatorial analyses. Though calculus and number theory are used occasionally, background in these fields of study is not assumed.
Уважаемый посетитель, Вы зашли на сайт как незарегистрированный пользователь.
С этой публикацией часто скачивают:
Data Structure and Algorithm (2023) Название: Data Structure and Algorithm Автор: Nikhat Raza Khan, Manmohan Singh, Piyush Kumar Издательство: Arcler Press Год: 2023 Страниц: 342 Язык:...
A Guide to Design and Analysis of Algorithms Название: A Guide to Design and Analysis of Algorithms Автор: Soubhik Chakraborty, Prashant Pranav, Naghma Khatoon Издательство: Nova Science...
Implementing Useful Algorithms in C++ Название: Implementing Useful Algorithms in C++ Автор: Dmytro Kedyk Издательство: Independently published Год: 2020 Страниц: 710 Размер: 94,54 МБ...
Randomized algorithms Название: Randomized algorithms Автор: Rajeev Motwani, Prabhakar Raghavan Издательство: Cambridge University Press Год: 1995 Формат: pdf Страниц: 487...
Design and Analysis of Algorithms Название: Design and Analysis of Algorithms Автор: Robert Karamagi Издательство: Amazon.com Services LLC Год: 2020 Страниц: 346 Язык: английский...
Design and Analysis of Computer Algorithms Название: Design and Analysis of Computer Algorithms Автор: Smartest Library Издательство: Smartest Library Год: 2020 Страниц: 393 Язык:...