Description

Book Synopsis
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.

Table of Contents
Preliminaries; Greedy Algorithms; Divide and Conquer; Dynamic Programming; Randomized Algorithms; Online Algorithms.

Introduction To The Analysis Of Algorithms, An

Product form

£35.15

Includes FREE delivery

RRP £37.00 – you save £1.85 (5%)

Order before 4pm tomorrow for delivery by Tue 20 Jan 2026.

A Hardback by Michael Soltys-kulinicz

Out of stock


    View other formats and editions of Introduction To The Analysis Of Algorithms, An by Michael Soltys-kulinicz

    Publisher: World Scientific Publishing Co Pte Ltd
    Publication Date: 19/10/2009
    ISBN13: 9789814271400, 978-9814271400
    ISBN10: 9814271403
    Also in:
    Maths for computer scientists

    Description

    Book Synopsis
    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.

    Table of Contents
    Preliminaries; Greedy Algorithms; Divide and Conquer; Dynamic Programming; Randomized Algorithms; Online Algorithms.

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account