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
Duration:00:01:38
Introduction
Duration:00:00:03
Overview of Algorithms
Duration:00:02:59
Importance and Applications
Duration:00:03:35
Algorithmic Complexity
Duration:00:03:10
Foundations of Algorithm Analysis
Duration:00:00:04
Asymptotic Notation
Duration:00:03:37
Time and Space Complexity
Duration:00:03:58
Recursion and Divide-and-Conquer
Duration:00:03:43
Sorting and Searching Algorithms
Duration:00:00:04
Bubble Sort
Duration:00:03:43
QuickSort
Duration:00:03:54
Merge Sort
Duration:00:03:05
Binary Search
Duration:00:03:32
Hashing Techniques
Duration:00:03:47
Graph Algorithms
Duration:00:00:03
Breadth-First Search (BFS)
Duration:00:03:30
Depth-First Search (DFS)
Duration:00:03:26
Comparing BFS and DFS
Duration:00:01:34
Practical Examples and Applications
Duration:00:00:56
Conclusion
Duration:00:00:20
Dijkstra’s Algorithm
Duration:00:05:28
Minimum Spanning Trees
Duration:00:02:56
Dynamic Programming
Duration:00:00:03
Overview and Principles
Duration:00:04:22
Longest Common Subsequence
Duration:00:02:55
Matrix Chain Multiplication
Duration:00:02:40
Greedy Algorithms
Duration:00:00:03
Introduction and Principles
Duration:00:02:19
Activity Selection
Duration:00:02:04
Huffman Coding
Duration:00:01:58
Prim’s Algorithm
Duration:00:02:18
Kruskal’s Algorithm
Duration:00:01:57
String Algorithms
Duration:00:00:03
Pattern Matching
Duration:00:02:45
Longest Prefix Suffix
Duration:00:01:26
Edit Distance
Duration:00:01:30
Trie Data Structure
Duration:00:02:06
Suffix Array and Longest Common Prefix
Duration:00:02:28
Advanced Topics
Duration:00:00:03
Randomized Algorithms
Duration:00:03:30
Approximation Algorithms
Duration:00:04:11
Parallel Algorithms
Duration:00:04:08
Network Flow Algorithms
Duration:00:03:35
String Matching Algorithms
Duration:00:03:42
Appendix
Duration:00:00:03
Algorithm Pseudocode Examples
Duration:00:02:33
Useful Mathematical Formulas
Duration:00:02:24
Resources and References
Duration:00:01:55