Erfan Khadem

I think we can implement some items on this list: ## Math - [x] Random number generation: - Basic implementation (#311) - Still many more features can be implemented there...

> Hi, all! I'd like to work on ternary search algorithm, if no one else is working on it. Awesome! I added your name to the list.

@siriak I have a question: I want to implement a few graph algorithms, and if they are represented using `BTreeMap`, a `log(n)` factor would be added to their time complexity...

> @er888kh, I think we can have both versions. Depending on the task at hand, both can be useful. That's certainly an option, but it would create a lot of...

Now that I have added (#309), it should be really easy to implement 2-SAT problem's solution. Here is my CPP [implementation](https://gist.github.com/er888kh/4201fc1c80a2d7f66de3422e1d314504) if anyone is interested.

@siriak, what is your opinion about moving towards creating a general purpose crate for crates.io? We already have the "basic infrastructure" and people can really benefit from these implementations.

I have an idea for implementing big number support: First, One can implement a really basic base 10 big number module. It only supports addition and multiplication by 2. It...

Well, I do have a minimalistic-ish GUI already written in python using PySide2 (can also use PyQt5). And for the terminal on windows, I use [Alacritty](https://github.com/alacritty/alacritty). By using pyinstaller, one...

> [Hash Array Mapped Trie (HAMT)](https://en.wikipedia.org/wiki/Hash_array_mapped_trie) ? Seems like a cool datastructure! Should I add it as WIP by you @YurySolovyov ?

> No, I'm still relatively new to rust, so I don't want to claim this item, it was purely a suggestion. HAMT combines hashing, trees and some binops, so I...