rudac 0.8.3

A crate for common data structures and algorithms
Documentation

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