1. Brute Force Algorithm
This algorithm tries each possible solution and checks them sequentially, deconstructing and repeating the process until the right one is found.
Example: The linear search algorithm checks all elements of the list one by one in search of the desired object.
2. Divide and Conquer Algorithm
A larger problem is divided into smaller subproblems, and each subproblem is solved recursively.
Example: Merge Sort and Quick Sort algorithms.
3. Greedy Algorithm
This algorithm makes a locally optimal choice at each stage with the hope that these choices will lead to a globally optimal solution.
Example: Dijkstra’s Algorithm, which is used to determine the shortest path to a specified target.
4. Dynamic Programming Algorithm
This algorithm solves complex problems by breaking them down into simpler subproblems. The solutions to these subproblems can be stored so that the same computation does not need to be executed again.
Example: Fibonacci Series and the Knapsack Problem.
5. Backtracking Algorithm
Decide on one direction, go step by step further, and if it turns out to have made a mistake go back.
Example: N-Queens Problem and Sudoku Solver.
6. Randomized Algorithm
A random component is used for problem-solving with this type of algorithm.
Example: Quick Sort (Pivot Randomization)
7. Recursive Algorithm
In this type of algorithm, a function calls itself repeatedly until a base condition is fulfilled.
Example: Calculating a factorial using recursion.
8. Search Algorithm
This is an algorithm used to search for a specified value within a data structure or a dataset.
Example: Binary search, Linear search.
9. Sorting Algorithm
This is an algorithm to arrange elements of a dataset in a particular sequence (ascending or descending order).
Example: Bubble sort, Insertion sort, Merge sort.
10. Hashing Algorithm
This algorithm converts an input into a unique hash value, which facilitates efficient searching and retrieval of data.
Example: SHA-256 and MD5 hashing algorithms.
11. Graph Algorithm
These algorithms are used to perform operations on nodes and edges of a graph.
Example: Breadth-First Search (BFS), Depth-First Search (DFS), Dijkstra algorithm.
12. String Matching Algorithms
These algorithms are used to find a specific pattern or substring within a large text or string.
Example: KMP algorithms, Rabin-Karp algorithms.
13. Computational Geometry Algorithms
These algorithms solve geometric problems such as convex hulls, triangulations, and shortest pathways.
Example: Graham's scan and Bentley-Ottmann algorithms.
14. Machine Learning Algorithm
Yeh algorithms pehchaan aur kisi chiz ko khat banane ya adaa karne ke liye kisi chiz ke pattern ko dhoondhne ki ground zero analysis ke liye hoti hain.
Example: Neural Networks, Decision Tree, K-Means Clustering.
15. Cryptographic Algorithm
Eeh algorithms ciphering ya jigsaw puzzle par baithi hui raw data ko khoj lagane ke liye aasaan aur complex level dede data ke surakh chalane ke laadlaa hota hai.
Example: Diffie-Hellman Key Exchange, RSA Algorithm, AES Encryption.
16. Numeral Algorithm
Yeh algorithms ginti karein aur sankya aakde daare ke row k with their arithmetic calculations saath mathematics mein solve kuch kaw tarayen banaye gaya hai.
Example: Gaussian Elimination, Newton Raphson Method.
17. Parallel Algorithm
Yeh algorithms peeele parallel ke liye design and builded karein computadores versis dispersed instructions for parallel execution using multi processors algorithms.
Example: Parallel Merge Sort, Map Reduce.
18. Approximation Algorithm
Yeh algorithms kahin na kahin udasi mh GOP dhundne dash problem z ke saath lagaye hoti hain.
Example: Approximation algorithm for Travelling Salesman Problem (TSP).
19. Quantum Algorithm
Eeh define solutions k reply basic assist through personnels pattern and computing algorithms mh apply gaye laype pheonic eak pattern of elofcus is form of using by eye sight n being soldiers respond to assistance.
Example: Shor’s Algorithm (integer factorization), Grover’s Algorithm (search algorithm).
20. Bioinformatics Algorithms
Yeh algorithms biological data analysis, DNA sequencing, aur protein structure prediction ke liye use hote hain.
Example: Smith-Waterman Algorithm, BLAST (Basic Local Alignment Search Tool claro).
21. Evolutionary Algorithm
Optimization problems ko solve karne ke liye yeh algorithm natural selection aur genetic principles ka istemaal karta hai.
Example: Genetic Algorithm, Ant Colony Optimization.
22. Scheduling Algorithm
In algorithms ka istemal task scheduling aur CPU scheduling ke liye hota hai.
Example: Round Robin, First Come First Serve (FCFS), Shortest Job Next (SJN).
23. Memory Management Algorithm
Computer ki memory allocation aur management ke liye in algorithms ka istemal hota hai.
Example: Paging, Segmentation, Garbage Collection Algorithms.
24. Compression Algorithm
Data ko compress karne ke liye in algorithms ka istemal hota hai taake storage aur transmission efficient ho.
Example: Huffman Coding, Run-Length Encoding (RLE), Lempel-Ziv-Welch (LZW).
25. Game Theory Algorithm
Strategic decision making aur uska optimization in algorithms ki madad se hota hai.
Example: Minimax Algorithm, Alpha-Beta Pruning.
26. Graph Traversal Algorithm
In algorithms ka istemal kisi graph ke nodes ko traverse karne ke liye hota hai.
Example: BFS (Breadth-First Search), DFS (Depth-First Search).
27. Data Mining Algorithm
Bade datasets se useful insights nikalne ke liye yeh algorithms use hote hain.
Example: Apriori Algorithm, Decision Tree, Clustering Algorithms.
28. Network Algorithm
Communication and interaction within computer networks in algorithms ka istemal hota hai.
Example: Link State Routing Algorithm, Distance Vector Routing Algorithm.
29. Pattern Recognition Algorithm
Yeh algorithms pattern detection aur recognition ke liye use hote hain.
Example: Support Vector Machines (SVM), K-Nearest Neighbors (KNN) Clone
30. Heuristic Algorithm
Yeh algorithms trial-and-error methods ka use karke problem-solving ke liye design kiye jate hain.
Example: A* Search Algorithm, Hill Climbing Algorithm.
