lib-wc
rust-algorithms
| lib-wc | rust-algorithms | |
|---|---|---|
| 1 | 3 | |
| 4 | 3,643 | |
| - | - | |
| 3.0 | 1.1 | |
| about 1 year ago | about 1 year ago | |
| Rust | Rust | |
| - | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
lib-wc
rust-algorithms
-
Anything C can do Rust can do Better
Algorithm Cookbook in Rust - Aram Ebtekar
-
Programming challenges + Rust
This blog post is a good introduction on how to use Rust for programming contests. You may also find this library of common data structures/algorithms as a good reference point.
- Coding platforms that support cargo
What are some alternatives?
seize - Fast, efficient, and robust memory reclamation for Rust.
ritelinked - RiteLinked - LinkedHashMap & LinkedHashSet in Rust
zentime-rs - Pomodoro + Productivity timer written in Rust
NumToA - An efficient method of heaplessly converting numbers into their string representations, storing the representation within a reusable byte array.
gryf - Graph data structure library aspiring to be convenient, versatile, correct and performant.
python - Official Python client library for kubernetes
r3bl-open-core - TUI framework and developer productivity apps in Rust 🦀
staticstep - Provides truly zero-cost alternatives to Iterator::step_by for both incrementing and decrementing any type that satisfies RangeBounds<T: Copy + Default + Step>.
leapfrog - Lock-free concurrent and single-threaded hash map implementations using Leapfrog probing. Currently the highest performance concurrent HashMap in Rust for certain use cases.
graph - A library for high-performant graph algorithms.
Rust - All Algorithms implemented in Rust
regex - An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.