
Livro digital
Título:
Algorithms
Autor:
Jeff Erickson
Categoria:
Tecnologia > Geral
Doador:
Raffaello D. N.
Sinopse:
Jeff Erickson's Algorithms is a demanding guide for readers who already know basic discrete math and data structures, and the table of contents makes that expectation clear from the start: after a compact introduction, it moves quickly into recursion, reductions, Tower of Hanoi, mergesort, quicksort, and the recurring patterns that make algorithm design feel tractable instead of mystical.
The book’s structure is practical and cumulative. Early chapters build the core habits of describing problems, analyzing correctness, and measuring running time, then expand into divide-and-conquer ideas through mergesort and quicksort before broadening into the deeper theory that supports more advanced algorithmic thinking. The subject matter is textbook CS, but the presentation is unusually candid and intellectually direct.
For a reader who wants more than a catalog of techniques, this volume offers a strong conceptual backbone: why algorithms work, how to reason about them, and how familiar problems can be recast through reduction and recursion. Its value lies in turning standard material into a coherent theory course, with enough rigor to challenge experienced students and enough structure to support steady self-study.