rudac
| Crates.io | rudac |
| lib.rs | rudac |
| version | 0.8.3 |
| created_at | 2020-04-22 13:09:50.873735+00 |
| updated_at | 2021-10-14 12:56:59.658947+00 |
| description | A crate for common data structures and algorithms |
| homepage | |
| repository | https://github.com/maminrayej/rudac |
| max_upload_size | |
| id | 232922 |
| size | 321,131 |
M.Amin Rayej (maminrayej)
documentation
README
rudac
Rudac is a Rust Data structure and Algorithm Crate. It aims to be a comprehensive crate of usefull data structure and algorithms.
It is still an ongoing project.
Data structures:
- Queue:
- Circular Queue / Circular Buffer
- Heap:
- Binomial Heap
- Fibonacci Heap
- Min-Max Heap
- Tree:
- Binomial Tree
- AVL Tree
- Red-Black Tree
- Interval Tree
- Utils:
- Interval (Open, closed and unbounded intervals)
Algorithms:
- Find:
- kth smallest item(including min, max, median)
- Search:
- Binary Search
- Exponential Search
- Fibonacci Search
- Linear Search
- Sort:
- Merge Sort
- Quick Sort
- Transformation:
- Partition around a pivot