Stock photo: cover may vary
An Introduction to the Analysis of Algorithms Hardback -
by Michael Soltys
- Used
- Hardback
A$70.00
A$5.82
Delivery within USA
Standard delivery: 9 to 14 days
More delivery options
Standard delivery: 9 to 14 days
Ships from Cold Books (New York, United States)
Details
- Title An Introduction to the Analysis of Algorithms
- Author Michael Soltys
- Binding Hardback
- Condition Used
- Pages 152
- Volumes 1
- Language ENG
- Publisher World Scientific Publishing Company, Incorporated
- Publication date pp. xiii + 135
- Features Bibliography, Index, Table of Contents
- Bookseller's Inventory # 61420934
- ISBN 9789814271400 / 9814271403
- Weight 0.9 lbs (0.41 kg)
- Dimensions 9 x 6.1 x 0.7 in (22.86 x 15.49 x 1.78 cm)
- Category Mathematics
- Library of Congress Catalogue Number 2010278418
- Dewey Decimal Code 519.4
- Quantity available 1
About Cold Books New York, United States
Reader reviews for An Introduction to the Analysis of Algorithms
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
From the jacket flap
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.
Media reviews
Citations
- Reference and Research Bk News, 02/01/2011, Page 242
