<<< Types of Algorithm

1. Recursive Algorithm: e.g. 

1. To find factorial using Recursion 

2. Dynamic Programming Algorithm: e.g. 

1. Multistage graph

2. All pairs Shortest path 

3. Fibonacci sequence

4. 0-1 knapsack problem

5. Mathematical optimization problem 

6. Reliability design problem 

7. Longest common subsequence (LCS)

8. Flight control and Robotics control 

9. Time-sharing: It schedules the job to maximize CPU usage

10. Optimal polygon triangulation problem

3. Backtracking Algorithm | O(K ^ N) where 'K' is the number of times the function calls itself: e.g. 

1. Queens Problem

2. Subset sum problem

4. Divide and Conquer Algorithm | O(n log n): Relational formula & Stopping condition e.g.

1. Sorting: e.g. 

1. Merge sort

2. Quick sort

2. Binary Tree Traversals

3. Binary Search

4. Multiplication of large integers

5. Matrix Multiplication: e.g. 

1. Strassen's Algorithm

6. Closest-pair and Convex-hull algorithm 

7. Maximum and minimum problem

8. Tower of Hanoi

5. Greedy Algorithm | O(n log n) or O(n): e.g. 

1. Huffman tree

2. Counting money

3. Fractional Knapsack problem

4. Minimum spanning tree

5. Prims Algorithm

6. Kruskals Algorithm

7. Job Scheduling Problem 

8. Dijkstra shortest path algorithm

9. Fractional knapsack problem

6. Brute Force Algorithm O(2^n): e.g. 

1. Exact string-matching algorithm

2. Linear search

7. Randomized Algorithm: e.g 

1. Quick sort (random number to choose the pivot point)

#Programming #Algorithm #CodeAnalysis #AbdurRahimRatulAliKhan

>>>