Get Free Shipping on orders over $79
Algorithms : A Top-Down Approach - Rodney R Howell

Algorithms

A Top-Down Approach

By: Rodney R Howell

eText | 4 January 2023

At a Glance

eText


$74.79

or 4 interest-free payments of $18.70 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

This comprehensive compendium provides a rigorous framework to tackle the daunting challenges of designing correct and efficient algorithms. It gives a uniform approach to the design, analysis, optimization, and verification of algorithms. The volume also provides essential tools to understand algorithms and their associated data structures.

This useful reference text describes a way of thinking that eases the task of proving algorithm correctness. Working through a proof of correctness reveals an algorithm's subtleties in a way that a typical description does not. Algorithm analysis is presented using careful definitions that make the analyses mathematically rigorous.

Related Link(s)

Contents:

  • Fundamentals:

    • Introduction
    • Proving Algorithm Correctness
    • Analyzing Algorithms
  • Data Structures:

    • Basic Techniques for Data Structures
    • Priority Queues
    • Storage/Retrieval I: Ordered Keys
    • Storage/Retrieval II: Unordered Keys
    • Disjoint Sets
    • Graphs
  • Algorithm Design Techniques:

    • Divide and Conquer
    • Optimization I: Greedy Algorithms
    • Optimization II: Dynamic Programming
  • Common Reduction Targets:

    • Depth-First Search
    • Network Flow and Matching
    • * The Fast Fourier Transform
  • Intractable Problems:

    • NP-Completeness
    • Approximation Algorithms

Readership: Researchers, professionals, academics, undergraduate and graduate students in theoretical computer science.

on
Desktop
Tablet
Mobile

More in Algorithms & Data Structures

Addiction by Design : Machine Gambling in Las Vegas - Natasha Dow Schüll

eBOOK

Deep Learning Crash Course - Giovanni Volpe

eBOOK

RRP $81.07

$64.99

20%
OFF