- Добавил: literator
- Дата: 26-09-2021, 12:22
- Комментариев: 0
Название: Introduction to the Design and Analysis of Algorithms : The Algorithms Guide
Автор: Engr. Michael David
Издательство: Independently published
Год: 2021
Страниц: 78
Язык: английский
Формат: pdf (true)
Размер: 10.15 MB
This book covers techniques for the design and analysis of algorithms. The algorithmic techniques covered include: divide and conquer, backtracking, dynamic programming, greedy algorithms, and hill-climbing. To understand the material presented in this book you need to know a programming language well enough to translate the pseudocode in this book into a working solution. You also need to know the basics about the following data structures: arrays, stacks, queues, linked-lists, trees, heaps (also called priority queues), disjoint sets, and graphs. Additionally, you should know some basic algorithms like binary search, a sorting algorithm (merge sort, heap sort, insertion sort, or others), and breadth-first or depth-first search.
Автор: Engr. Michael David
Издательство: Independently published
Год: 2021
Страниц: 78
Язык: английский
Формат: pdf (true)
Размер: 10.15 MB
This book covers techniques for the design and analysis of algorithms. The algorithmic techniques covered include: divide and conquer, backtracking, dynamic programming, greedy algorithms, and hill-climbing. To understand the material presented in this book you need to know a programming language well enough to translate the pseudocode in this book into a working solution. You also need to know the basics about the following data structures: arrays, stacks, queues, linked-lists, trees, heaps (also called priority queues), disjoint sets, and graphs. Additionally, you should know some basic algorithms like binary search, a sorting algorithm (merge sort, heap sort, insertion sort, or others), and breadth-first or depth-first search.