This section contains different algorithms for solving basic problems. As the
challenge is intended to teach algorithm themselves, we will not be using any
built-in methods such as sort()
, index()
, etc.
List Of Algorithms are as follows:
- Linear Searching
cargo run --bin linear_search
- Binary Searching
cargo run --bin binary_search
- [Depth First Search (DFS)]
- [Breadth First Search (BFS)]
- bubble sort
cargo run --bin bubble_sort
- selection sort
cargo run --bin selection_sort
- insertion sort
cargo run --bin insertion_sort
- quick sort
cargo run --bin quick_sort
- [Merge sort]
- [heap Sort]
- [Counting Sort]
- [Radix Sort]
- [Activity Selection]
- Huffman Coding
cargo run --bin huffman
- Krushkal's algorithm
cargo run --bin kruskal
- [Prim's Algorithm]
- [Dijkstra's Algorithm]
- [Bellman-Ford Algorithm]
- [Floyd-Warshall Algorithm]
- [Topological Sort]
- [A* Search Algorithm]