
- Home
- Books
- Algorithms & Data Structures
- Core Algorithms
- Foundations of Algorithms 5th
Foundations of Algorithms by Richard E. Neapolitan develops algorithm-design techniques alongside complexity analysis. The fifth edition uses pseudocode to separate the central idea of an algorithm from the details of a particular programming language. Worked examples and exercises connect design methods with arguments about performance, then place those methods within the broader study of computational complexity.
What you will learn
- Apply divide-and-conquer, dynamic programming and greedy methods
- Analyze algorithm correctness and complexity
- Distinguish tractable problems from computationally difficult ones
Who this is for
Computer science students taking an algorithms course. Data structures and discrete mathematics are useful prerequisites.


