This post is about algorithms.
Greedy algorithms are those where on each stage you make the best choice, and may not get the optimal solution but you may get a good one.
Algorithms by Function
Types of algorithms featured on this post:
- Sorting
- Search
- Routing
Sorting Algorithms
You can read this post about sorting algorithms.
Search Algorithms
Search algorithms:
- Backtracking
- Binary / Dichotomic
- A*
The backtracking search algorithm is used for solving constraint satisfaction problems.
A binary or dichotomic search algorithm operates by selecting between two distinct alternatives (dichotomies or polychotomies when they are more than two) at each step.
A* algorithm is used for pathfinding and graph traversal.
Routing Algorithms
The routing algorithms are designed to find the shortest path in graphs.
Examples of routing algorithms are Bellman-Ford and Dijkstra.
You can read this post about routing algorithms.