rudac 0.8.1

A crate for common data structures and algorithms
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

# rudac
[![Crate](https://img.shields.io/crates/v/rudac.svg)](https://crates.io/crates/rudac)
[![API](https://docs.rs/rudac/badge.svg)](https://docs.rs/rudac)

Rudac is a **Ru**st **D**ata structure and **A**lgorithm **C**rate.
It aims to be a comprehensive crate of usefull data structure and algorithms.

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