Amazon cover image
Image from Amazon.com
Image from Google Jackets

Algorithms unlocked / Thomas H. Cormen.

By: Material type: TextTextPublication details: Cambridge, Massachusetts : The MIT Press, [2013].Description: xiii, 222 p. : ill. ; 23 cmISBN:
  • 9780262518802 (pbk.)
Subject(s): DDC classification:
  • 005.1 COR 23 006290
Online resources:
Contents:
Machine generated contents note: 1.What Are Algorithms and Why Should You Care? Correctness Resource usage Computer algorithms for non-computer people Computer algorithms for computer people Further reading 2.How to Describe and Evaluate Computer Algorithms How to describe computer algorithms How to characterize running times Loop invariants Recursion 3.Algorithms for Sorting and Searching Binary search Selection sort Insertion sort Merge sort Quicksort Recap 4.A Lower Bound for Sorting and How to Beat It Rules for sorting The lower bound on comparison sorting Beating the lower bound with counting sort Radix sort 5.Directed Acyclic Graphs Directed acyclic graphs Topological sorting How to represent a directed graph Running time of topological sorting Critical path in a PERT chart Shortest path in a directed acyclic graph Contents note continued: Further reading 6.Shortest Paths Dijkstra's algorithm The Bellman-Ford algorithm The Floyd-Warshall algorithm 7.Algorithms on Strings Longest common subsequence Transforming one string to another String matching 8.Foundations of Cryptography Simple substitution ciphers Symmetric-key cryptography Public-key cryptography The RSA cryptosystem Hybrid cryptosystems Computing random numbers 9.Data Compression Huffman codes Fax machines LZW compression 10.Hard? Problems Brown trucks The classes P and NP and NP-completeness Decision problems and reductions A Mother Problem A sampler of NP-complete problems General strategies Perspective Undecidable problems Wrap-up Further reading.
Star ratings
    Average rating: 0.0 (0 votes)

Includes bibliographical references (pages 213-214) and index.

Machine generated contents note: 1.What Are Algorithms and Why Should You Care?
Correctness
Resource usage
Computer algorithms for non-computer people
Computer algorithms for computer people
Further reading
2.How to Describe and Evaluate Computer Algorithms
How to describe computer algorithms
How to characterize running times
Loop invariants
Recursion
3.Algorithms for Sorting and Searching
Binary search
Selection sort
Insertion sort
Merge sort
Quicksort
Recap
4.A Lower Bound for Sorting and How to Beat It
Rules for sorting
The lower bound on comparison sorting
Beating the lower bound with counting sort
Radix sort
5.Directed Acyclic Graphs
Directed acyclic graphs
Topological sorting
How to represent a directed graph
Running time of topological sorting
Critical path in a PERT chart
Shortest path in a directed acyclic graph
Contents note continued: Further reading
6.Shortest Paths
Dijkstra's algorithm
The Bellman-Ford algorithm
The Floyd-Warshall algorithm
7.Algorithms on Strings
Longest common subsequence
Transforming one string to another
String matching
8.Foundations of Cryptography
Simple substitution ciphers
Symmetric-key cryptography
Public-key cryptography
The RSA cryptosystem
Hybrid cryptosystems
Computing random numbers
9.Data Compression
Huffman codes
Fax machines
LZW compression
10.Hard? Problems
Brown trucks
The classes P and NP and NP-completeness
Decision problems and reductions
A Mother Problem
A sampler of NP-complete problems
General strategies
Perspective
Undecidable problems
Wrap-up
Further reading.

There are no comments on this title.

to post a comment.