Skip to Content
Algorithms, 4th Edition
book

Algorithms, 4th Edition

by Robert Sedgewick, Kevin Wayne
March 2011
Intermediate
976 pages
28h 1m
English
Addison-Wesley Professional
Content preview from Algorithms, 4th Edition

Clients

Fundamentals

Whitelisting

Expression evaluation

Connectivity

Sorting

Comparing two algorithms

Top M

Multiway merge

Symbol Tables

Dedup

Frequency counter

Dictionary lookup

Index lookup

File indexing

Sparse vector with dot product

Graphs

Symbol graph data type

Degrees of separation

Critical-path method

Arbitrage

Strings

Regular expression pattern matching

Huffman compression

Lempel-Ziv-Welch compression

Context

Colliding particle simulation

B-tree set

Suffix array (elementary)

Longest repeated substring

Keyword in context

Maxflow (Ford-Fulkerson)

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

A Common-Sense Guide to Data Structures and Algorithms, Second Edition, 2nd Edition

A Common-Sense Guide to Data Structures and Algorithms, Second Edition, 2nd Edition

Jay Wengrow
Grokking Algorithms

Grokking Algorithms

Aditya Bhargava
Programming Rust, 2nd Edition

Programming Rust, 2nd Edition

Jim Blandy, Jason Orendorff, Leonora F. S. Tindall

Publisher Resources

ISBN: 9780132762564