Skip to content

Rudac is a Rust Data structure and Algorithm Crate. It aims to be a comprehensive crate of useful data structure and algorithms.

Notifications You must be signed in to change notification settings

maminrayej/rudac

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

72 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

rudac

Crate API

Rudac is a Rust Data structure and Algorithm Crate. 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

About

Rudac is a Rust Data structure and Algorithm Crate. It aims to be a comprehensive crate of useful data structure and algorithms.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Languages