Algorithms: Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Algorithms == === Sorting === * Bubble Sort * Selection Sort * Insertion Sort * Merge Sort * Quick Sort * Heap Sort === Searching === * Linear Search * Binary Search === Graph Algorithms === * Breadth-First Search * Depth-First Search * Dijkstra's Algorithm * Floyd-Warshall Algorithm * Kruskal's Algorithm * Prim's Algorithm * Topological Sort * Bellman-Ford Algorithm === Dynamic Programming...") |
No edit summary |
||
| Line 41: | Line 41: | ||
* [[Two Pointers Technique]] | * [[Two Pointers Technique]] | ||
* [[Meet in the Middle]] | * [[Meet in the Middle]] | ||
[[Category:Algorithms]] | |||
Latest revision as of 23:23, 6 May 2023
Algorithms[edit]
Sorting[edit]
Searching[edit]
Graph Algorithms[edit]
- Breadth-First Search
- Depth-First Search
- Dijkstra's Algorithm
- Floyd-Warshall Algorithm
- Kruskal's Algorithm
- Prim's Algorithm
- Topological Sort
- Bellman-Ford Algorithm
Dynamic Programming[edit]
Greedy Algorithms[edit]
- Activity Selection
- Huffman Coding
- [Fractional Knapsack Problem]]