# Algorithms in Rust [![](https://img.shields.io/travis/StardustDL/Algorithms-in-Rust.svg)](https://travis-ci.org/StardustDL/Algorithms-in-Rust) [![](https://img.shields.io/codecov/c/gh/StardustDL/Algorithms-in-Rust.svg)](https://codecov.io/gh/StardustDL/Algorithms-in-Rust) [![Codacy Badge](https://api.codacy.com/project/badge/Grade/27703a0a0f0b44efa7d3e2586ef63f84)](https://www.codacy.com/app/StardustDL/Algorithms-in-Rust?utm_source=github.com&utm_medium=referral&utm_content=StardustDL/Algorithms-in-Rust&utm_campaign=Badge_Grade) [![](https://img.shields.io/librariesio/github/StardustDL/Algorithms-in-Rust.svg)](https://libraries.io/cargo/rsalgo) [![](https://img.shields.io/crates/v/rsalgo.svg)](https://crates.io/crates/rsalgo) [![](https://img.shields.io/crates/v/rsalgo.svg?label=docs&&colorA=blue)](https://docs.rs/rsalgo/) ![](https://img.shields.io/crates/d/rsalgo.svg) ![](https://img.shields.io/crates/l/rsalgo.svg) [![Average time to resolve an issue](http://isitmaintained.com/badge/resolution/StardustDL/Algorithms-in-Rust.svg)](http://isitmaintained.com/project/StardustDL/Algorithms-in-Rust "Average time to resolve an issue") [![Percentage of issues still open](http://isitmaintained.com/badge/open/StardustDL/Algorithms-in-Rust.svg)](http://isitmaintained.com/project/StardustDL/Algorithms-in-Rust "Percentage of issues still open") ## Algorithms - [x] Discretization - [x] Dichotomy - [x] Lower bound - [x] Upper bound - [x] Equal range - [x] Inversion pairs - [x] Next subset - [ ] Quick pow, quick multiply - [ ] Matrix - [ ] Prime test - [ ] GCD, LCM - [ ] Inverse element (Modal meaning) - [ ] Linear sieve - [ ] Trichotomy - [ ] Tree diameter ## Data-structures - [ ] Disjoint set - [ ] Monotonic queue - [ ] Sparse Table - [ ] Prefix sum - [ ] Fenwick tree - [ ] Segment tree - [ ] Leftist heap - [ ] Trie - [ ] String hash - [ ] Shortest path - [ ] Single source - [ ] Multi source - [ ] Topological sorting - [ ] DFS order - [ ] Minimum spanning tree ## Development ```sh $ cargo test ```