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

Skip to content

Introduction To The Analysis Of Algorithms, An

Introduction To The Analysis Of Algorithms, An

Introduction To The Analysis Of Algorithms, An Hardback - 2009

by Michael Soltys

Add to wish list
  • New
  • Hardback
New

Description

Hardback. New. Covers the mathematical foundations of the analysis of algorithms. This book considers the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide and Conquer. It is suitable for undergraduate students in computer science and mathematics.
Ask the seller a question Add to wish list
A$76.15
A$19.01 Delivery to USA
Standard delivery: 14 to 21 days
More delivery options
Ships from The Saint Bookstore (Merseyside, United Kingdom)

Details

  • Title Introduction To The Analysis Of Algorithms, An
  • Author Michael Soltys
  • Binding Hardback
  • Condition New
  • 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 # A9789814271400
  • 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 10

About The Saint Bookstore Merseyside, United Kingdom

Biblio member since 2018

The Saint Bookstore specialises in hard to find titles & also offers delivery worldwide for reasonable rates.

Terms of Sale: Refunds or Returns: A full refund of the price paid will be given if returned within 30 days in undamaged condition. If the product is faulty, we may send a replacement.

Browse books from The Saint Bookstore

Reader reviews for Introduction To The Analysis Of Algorithms, An

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-