BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

An Introduction to the Analysis of Algorithms

An Introduction to the Analysis of Algorithms

An Introduction to the Analysis of Algorithms
Stock photo: cover may vary

An Introduction to the Analysis of Algorithms Paperback - 2009

by Michael, Soltys

Add to wish list
  • Used
  • Good
  • Paperback
Used - Good

Description

paperback. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Ask the seller a question Add to wish list
A$100.23
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Dropship order
Ships from Bonita (California, United States)

Details

  • Title An Introduction to the Analysis of Algorithms
  • Author Michael, Soltys
  • Binding Paperback
  • Condition Used - Good
  • Pages 152
  • Volumes 1
  • Language ENG
  • Publisher World Scientific Publishing Company
  • Publication date 2009-11-01
  • Features Bibliography, Index, Table of Contents
  • Bookseller's Inventory # 9814271403.G
  • 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 Bonita California, United States

Biblio member since 2020

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Bonita

Reader reviews for An Introduction to the Analysis of Algorithms

From the publisher

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.

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
tracking-