An introduction to the analysis of algorithms [electronic resource] / Michael Soltys.
By: Soltys, Michael
.
Material type: 
Computer filePublisher: Singapore : World Scientific Publishing Co. Pte Ltd., ©2009Description: 1 online resource (152 p.) : ill.ISBN: 9789814271424.Subject(s): Algorithms -- Textbooks | Electronic booksDDC classification: 518/.1 Online resources: Access to full text is restricted to subscribers. Summary: "This textbook covers the mathematical foundations of the analysis of algorithms. The gist of the book is how to argue, without the burden of excessive formalism, that a given algorithm does what it is supposed to do. The two key ideas of the proof of correctness, induction and invariance, are employed in the framework of pre/post-conditions and loop invariants. The algorithms considered are the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide & Conquer. In addition, two classes of algorithms that rarely make it into introductory textbooks are discussed. Randomized algorithms, which are now ubiquitous because of their applications to cryptography; and Online algorithms, which are essential in fields as diverse as operating systems (caching, in particular) and stock-market predictions. This self-contained book is intended for undergraduate students in computer science and mathematics."-- Publisher's website.
System requirements: Adobe Acrobat Reader.
Mode of access: World Wide Web.
Title from web page (viewed December 20, 2018).
Includes bibliographical references (p. 129-130) and index
"This textbook covers the mathematical foundations of the analysis of algorithms. The gist of the book is how to argue, without the burden of excessive formalism, that a given algorithm does what it is supposed to do. The two key ideas of the proof of correctness, induction and invariance, are employed in the framework of pre/post-conditions and loop invariants. The algorithms considered are the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide & Conquer. In addition, two classes of algorithms that rarely make it into introductory textbooks are discussed. Randomized algorithms, which are now ubiquitous because of their applications to cryptography; and Online algorithms, which are essential in fields as diverse as operating systems (caching, in particular) and stock-market predictions. This self-contained book is intended for undergraduate students in computer science and mathematics."-- Publisher's website.
There are no comments for this item.