This is me having fun implementing various algorithms and datastructures in Rust. Being idiomatic for the language is not particularly a goal--much of this code could be satisfied by the standard library instead.
Algorithms operating on vectors. Most can be further generalized to deal with more arbitrary collections and types.
Sorts: quick, heap, merge, insertion, selection, bubble, bogo, shaker, binary insertion.
Searches: binary, jump
Selects: quick, naive
Misc: Fisher-Yates shuffle, Boyer-Moore Majority, Partition by Pivot, Max Heap, Reverse, Is Sorted, Is Anagram, Deduplicate