Here you'll find algorithms that are currently under construction. Suggestions and feedback is welcome!
Special-purpose sorts:
- [Radix Sort](Radix Sort/)
- [Bucket Sort](Bucket Sort/)
- [Bounded Priority Queue](Bounded Priority Queue). A queue that is bounded to have a limited number of elements.
- [AVL Tree](AVL Tree/). A binary search tree that balances itself using rotations.
- [Red-Black Tree](Red-Black Tree/)
- [Threaded Binary Tree](Threaded Binary Tree/)
- [Ternary Search Tree](Ternary Search Tree/)
- Trie
- [Radix Tree](Radix Tree/)
- [Minimum Edit Distance](Minimum Edit Distance/). Measure the similarity of two strings by counting the number of operations required to transform one string into the other.
- Treap
- [Set Cover (Unweighted)](Set Cover (Unweighted)/)