Titre :	The Art of Algorithm Design
Type de document :	document électronique
Auteurs :	Mohanty Sachi Nandan ; Tripathy Pabitra Kumar ; Satpathy Suneeta
Editeur :	Boca Raton : CRC Press
Année de publication :	2022
Importance :	1 vol (298 p.)
ISBN/ISSN/EAN :	978-1-00-046378-1
Langues :	Français (fre)
Catégories :	Bibliothèque numérique:Informatique
Mots-clés :	Computer algorithms
Index. décimale :	004 Informatique
Résumé :	The Art of Algorithm Design is a complementary perception of all books on algorithm design and is a roadmap for all levels of learners as well as professionals dealing with algorithmic problems. Further, the book provides a comprehensive introduction to algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. All algorithms are described and designed with a'pseudo-code'to be readable by anyone with little knowledge of programming.This book comprises of a comprehensive set of problems and their solutions against each algorithm to demonstrate its executional assessment and complexity, with an objective to: Understand the introductory concepts and design principles of algorithms and their complexities Demonstrate the programming implementations of all the algorithms using C-Language Be an excellent handbook on algorithms with self-explanatory chapters enriched with problems and solutions While other books may also cover some of the same topics, this book is designed to be both versatile and complete as it traverses through step-by-step concepts and methods for analyzing each algorithmic complexity with pseudo-code examples. Moreover, the book provides an enjoyable primer to the field of algorithms.This book is designed for undergraduates and postgraduates studying algorithm design
Note de contenu :	TABLE OF CONTENTS Chapter 1. Fundamental Concepts of Data Structure. Chapter 2. Concepts of Algorithms and Recurrences. Chapter 3. Divide-and-Conquer Techniques. Chapter 4. Dynamic Programming. Chapter 5. Greedy Algorithms. Chapter 6. Graph. Chapter 7. Approximation Algorithms. Chapter 8. Matrix Operations, Linear Programming, Polynomial and FFT. Chapter 9. Number Theoretic Algorithms. Chapter 10. Programming Implementations of the Algorithms
Côte titre :	E-Fs/0052
En ligne :	https://sciences-courses.univ-setif.dz/login/index.php

The Art of Algorithm Design [document électronique] / Mohanty Sachi Nandan ; Tripathy Pabitra Kumar ; Satpathy Suneeta . - Boca Raton : CRC Press, 2022 . - 1 vol (298 p.).
ISBN : 978-1-00-046378-1
Langues : Français (fre)

Catégories :	Bibliothèque numérique:Informatique
Mots-clés :	Computer algorithms
Index. décimale :	004 Informatique
Résumé :	The Art of Algorithm Design is a complementary perception of all books on algorithm design and is a roadmap for all levels of learners as well as professionals dealing with algorithmic problems. Further, the book provides a comprehensive introduction to algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. All algorithms are described and designed with a'pseudo-code'to be readable by anyone with little knowledge of programming.This book comprises of a comprehensive set of problems and their solutions against each algorithm to demonstrate its executional assessment and complexity, with an objective to: Understand the introductory concepts and design principles of algorithms and their complexities Demonstrate the programming implementations of all the algorithms using C-Language Be an excellent handbook on algorithms with self-explanatory chapters enriched with problems and solutions While other books may also cover some of the same topics, this book is designed to be both versatile and complete as it traverses through step-by-step concepts and methods for analyzing each algorithmic complexity with pseudo-code examples. Moreover, the book provides an enjoyable primer to the field of algorithms.This book is designed for undergraduates and postgraduates studying algorithm design
Note de contenu :	TABLE OF CONTENTS Chapter 1. Fundamental Concepts of Data Structure. Chapter 2. Concepts of Algorithms and Recurrences. Chapter 3. Divide-and-Conquer Techniques. Chapter 4. Dynamic Programming. Chapter 5. Greedy Algorithms. Chapter 6. Graph. Chapter 7. Approximation Algorithms. Chapter 8. Matrix Operations, Linear Programming, Polynomial and FFT. Chapter 9. Number Theoretic Algorithms. Chapter 10. Programming Implementations of the Algorithms
Côte titre :	E-Fs/0052
En ligne :	https://sciences-courses.univ-setif.dz/login/index.php