Karamagi Robert. Design and Analysis of Algorithms

Independently published, 2020. — 346 p. — ISBN B08LD1NKL1.An Algorithm is a sequence of steps to solve a problem. Design and Analysis of Algorithm is very important for designing algorithm to solve different types of problems in the branch of computer science and information technology. This book introduces the fundamental concepts of Designing Strategies, Complexity analysis of Algorithms, followed by problems on Graph Theory and Sorting methods.Algorithm
Asymptotic Analysis
Recurrence
Substitution Method
Iteration Method
Recursion Tree Method
Master Method
Sorting Analysis
Bubble Sort
Selection Sort
Insertion Sort
Divide and Conquer
Max - Min Problem
Binary Search
Merge Sort
Tower of Hanoi
Sorting
Heap Sort
Quick Sort
Stable Sorting
Lower Bound Theory
Sorting in Linear Time
Linear Time Sorting
Counting Sort
Bucket Sort
Radix Sort
Hashing
Hash Tables
Methods of Hashing
Open Addressing Techniques
Hash Function
Binary Search Trees
Red Black Tree
Dynamic Programming
Fibonacci Sequence
Matrix Chain Multiplication
Longest Common Sequence (LCS)
0/1 Knapsack Problem
Dutch National Flag
Longest Palindrome Subsequence
Greedy Algorithm
Activity Selection Problem
Fractional Knapsack
Huffman Codes
Activity or Task Scheduling Problem
Travelling Sales Person Problem
Backtracking
Recursive Maze Algorithm
Hamiltonian Circuit Problems
Subset-Sum Problem
N-Queens Problem
Minimum Spanning Tree
Kruskal's Algorithm
Prim's Algorithm
Shortest Paths
Negative Weight Edges
Representing Shortest Path
Relaxation
Dijkstra's Algorithm
Bellman-Ford Algorithm
Single Source Shortest Path in Directed Acyclic Graphs
All-Pairs Shortest Paths
Floyd-Warshall Algorithm
Johnson's Algorithm
Flow
Network Flow Problems
Ford-Fulkerson Algorithm
Maximum Bipartite Matching
Sorting Networks
Comparison Networks
Bitonic Sorting Network
Merging Network
Complexity Theory
Polynomial Time Verification
NP-Completeness
Circuit Satisfiability
3CNF Satisfiability
Clique
Vertex Cover
Subset Cover
Approximate Algorithms
Vertex Cover
Traveling-salesman Problem
String Matching
Naive String Matching Algorithm
Rabin-Karp-Algorithm
String Matching with Finite Automata
Knuth-Morris-Pratt (KMP)Algorithm
Boyer-Moore Algorithm