Soltys, Michael,  1971- <br/><br/>
An introduction to the analysis of algorithms  [electronic resource] / 
Michael Soltys. 
 - Singapore :  World Scientific Publishing Co. Pte Ltd.,  ©2009. 
 - 1 online resource (152 p.) :  ill. 
<br/><br/>Includes bibliographical references (p. 129-130) and index 
<br/><br/> "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."-- 
<br/><br/><br/>System requirements: Adobe Acrobat Reader. <br/>Mode of access: World Wide Web. 
<br/><br/><label>ISBN: </label>9789814271424 
<br/><br/><label>LCCN: </label>
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms--Textbooks.<br/>Electronic books.
<br/><br/><label>LC Class. No.: </label>QA9.58  / .S63 2009 
<br/><br/><label>Dewey Class. No.: </label>518/.1