A Handbook of Algorithms
N.B. Singh
This audiobook is narrated by a digital voice.
"A Handbook of Algorithms" is a comprehensive guide designed for absolute beginners, providing a gentle introduction to the fascinating world of algorithms. This accessible resource covers essential topics in algorithmic problem-solving, offering clear explanations and practical examples to help readers grasp fundamental concepts. From basic algorithms to more advanced techniques, this handbook equips learners with the knowledge and skills needed to tackle a wide range of computational challenges. With step-by-step explanations and illustrative examples, this book serves as an invaluable companion for anyone embarking on their journey to algorithmic proficiency.
Duration - 1h 56m.
Author - N.B. Singh.
Narrator - Digital Voice Mary G.
Published Date - Monday, 20 January 2025.
Copyright - © 2024 N.B. Singh ©.
Location:
United States
Description:
This audiobook is narrated by a digital voice. "A Handbook of Algorithms" is a comprehensive guide designed for absolute beginners, providing a gentle introduction to the fascinating world of algorithms. This accessible resource covers essential topics in algorithmic problem-solving, offering clear explanations and practical examples to help readers grasp fundamental concepts. From basic algorithms to more advanced techniques, this handbook equips learners with the knowledge and skills needed to tackle a wide range of computational challenges. With step-by-step explanations and illustrative examples, this book serves as an invaluable companion for anyone embarking on their journey to algorithmic proficiency. Duration - 1h 56m. Author - N.B. Singh. Narrator - Digital Voice Mary G. Published Date - Monday, 20 January 2025. Copyright - © 2024 N.B. Singh ©.
Language:
English
Preface
Duración:00:01:38
Introduction
Duración:00:00:03
Overview of Algorithms
Duración:00:02:59
Importance and Applications
Duración:00:03:35
Algorithmic Complexity
Duración:00:03:10
Foundations of Algorithm Analysis
Duración:00:00:04
Asymptotic Notation
Duración:00:03:37
Time and Space Complexity
Duración:00:03:58
Recursion and Divide-and-Conquer
Duración:00:03:43
Sorting and Searching Algorithms
Duración:00:00:04
Bubble Sort
Duración:00:03:43
QuickSort
Duración:00:03:54
Merge Sort
Duración:00:03:05
Binary Search
Duración:00:03:32
Hashing Techniques
Duración:00:03:47
Graph Algorithms
Duración:00:00:03
Breadth-First Search (BFS)
Duración:00:03:30
Depth-First Search (DFS)
Duración:00:03:26
Comparing BFS and DFS
Duración:00:01:34
Practical Examples and Applications
Duración:00:00:56
Conclusion
Duración:00:00:20
Dijkstra’s Algorithm
Duración:00:05:28
Minimum Spanning Trees
Duración:00:02:56
Dynamic Programming
Duración:00:00:03
Overview and Principles
Duración:00:04:22
Longest Common Subsequence
Duración:00:02:55
Matrix Chain Multiplication
Duración:00:02:40
Greedy Algorithms
Duración:00:00:03
Introduction and Principles
Duración:00:02:19
Activity Selection
Duración:00:02:04
Huffman Coding
Duración:00:01:58
Prim’s Algorithm
Duración:00:02:18
Kruskal’s Algorithm
Duración:00:01:57
String Algorithms
Duración:00:00:03
Pattern Matching
Duración:00:02:45
Longest Prefix Suffix
Duración:00:01:26
Edit Distance
Duración:00:01:30
Trie Data Structure
Duración:00:02:06
Suffix Array and Longest Common Prefix
Duración:00:02:28
Advanced Topics
Duración:00:00:03
Randomized Algorithms
Duración:00:03:30
Approximation Algorithms
Duración:00:04:11
Parallel Algorithms
Duración:00:04:08
Network Flow Algorithms
Duración:00:03:35
String Matching Algorithms
Duración:00:03:42
Appendix
Duración:00:00:03
Algorithm Pseudocode Examples
Duración:00:02:33
Useful Mathematical Formulas
Duración:00:02:24
Resources and References
Duración:00:01:55