Skip to content

Open Textbooks

Algorithms

Fundamental techniques

Wikibooks contributors

Divide and conquer, randomization, backtracking, dynamic programming, greedy algorithms and hill climbing.

IntermediateTextbookComputers & Technology › Algorithms & Data Structures

10 chapters1 appendix

Contents

About this book

The techniques of algorithm design, each with worked problems: the mathematical background, divide and conquer, randomization, backtracking, dynamic programming, greedy algorithms, hill climbing and graph algorithms, with an appendix of implementations in Ada.

From Wikibooks · CC BY-SA 4.0

Algorithms, a Wikibooks textbook, by its contributors. This book is not stored in this library: each chapter is read from Wikibooks when it is opened, shown in this library's format, and ends with its own attribution. Licence: CC BY-SA 4.0. Modified: converted to this format.