Writing algorithms is a good way of learning the "ways", or better, the expressiveness of the rust language
- Merge
- In-place Merge Algorithm with O(n+m) swaps
- Sequential access across multiple slices
- Lazy merge and deferred slice mutability
- De-normalise control flow with pattern matching
- Sorting
- MergeSort O(n log n)
- QuickSort O(n log n)
- CountSort O(n)
- Selection
- Random
- Deterministic
- Graphs
- Minimum Cut
- Path Search
- Strong Connectivity
- Greedy Algorithms
- Minimum Spanning Trees
- Single-linkage clustering
- Scheduling
- Linked list
- Binary tree