Algorithms Illuminated Part 3

Accessible, no-nonsense, and programming language-agnostic introduction to algorithms.

Algorithms Illuminated  Part 3

Author: Tim Roughgarden

Publisher:

ISBN: 9780999282946

Page: 230

View: 171

Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).

Related Books:

Algorithms Illuminated (Part 3)
Language: en
Pages: 230
Authors: Tim Roughgarden
Categories: Computers
Type: BOOK - Published: 2019-05-09 - Publisher:

Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).
Algorithms Illuminated (Part 4)
Language: en
Pages: 272
Authors: Tim Roughgarden
Categories: Computers
Type: BOOK - Published: 2020-07-20 - Publisher:

Books about Algorithms Illuminated (Part 4)
Algorithms Illuminated
Language: en
Pages: 209
Authors: Tim Roughgarden
Categories: Computers
Type: BOOK - Published: 2018 - Publisher:

Books about Algorithms Illuminated
Algorithmic Thinking
Language: en
Pages: 408
Authors: Daniel Zingaro
Categories: Computers
Type: BOOK - Published: 2020-12-15 - Publisher: No Starch Press

A hands-on, problem-based introduction to building algorithms and data structures to solve problems with a computer. Algorithmic Thinking will teach you how to solve challenging programming problems and design your own algorithms. Daniel Zingaro, a master teacher, draws his examples from world-class programming competitions like USACO and IOI. You'll learn
Beyond the Worst-Case Analysis of Algorithms
Language: en
Pages: 704
Authors: Tim Roughgarden
Categories: Computers
Type: BOOK - Published: 2021-01-14 - Publisher: Cambridge University Press

Introduces exciting new methods for assessing algorithms for problems ranging from clustering to linear programming to neural networks.