Skip to content

Latest commit

 

History

History
39 lines (30 loc) · 1.22 KB

README.md

File metadata and controls

39 lines (30 loc) · 1.22 KB

Rust Raid

Algorithms

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:

searching

  1. Linear Searching cargo run --bin linear_search
  2. Binary Searching cargo run --bin binary_search
  3. [Depth First Search (DFS)]
  4. [Breadth First Search (BFS)]

sorting

  1. bubble sort cargo run --bin bubble_sort
  2. selection sort cargo run --bin selection_sort
  3. insertion sort cargo run --bin insertion_sort
  4. quick sort cargo run --bin quick_sort
  5. [Merge sort]
  6. [heap Sort]
  7. [Counting Sort]
  8. [Radix Sort]

Greedy and graph algorithms

  1. [Activity Selection]
  2. Huffman Coding cargo run --bin huffman
  3. Krushkal's algorithm cargo run --bin kruskal
  4. [Prim's Algorithm]
  5. [Dijkstra's Algorithm]
  6. [Bellman-Ford Algorithm]
  7. [Floyd-Warshall Algorithm]
  8. [Topological Sort]
  9. [A* Search Algorithm]