Weihang Lo

Thank you! Could you help format the code?

I'll take doubly linked list!

@choznerol That's awesome!

@choznerol If possible, I would like to see an implementation with some [basic operations of set](https://en.wikipedia.org/wiki/Set_(mathematics)#Basic_operations). For instance, Python 3 allows intersection of two sets be computed with [BitAnd](https://doc.rust-lang.org/1.29.1/core/ops/trait.BitAnd.html) `&`...

Tutorial of [Set](https://github.com/weihanglo/rust-algorithm-club/tree/master/src/collections/set) would be tracked under #20

Wow. It's a good question. Selection algorithms use a mix of searching and sorting (and many others). Seems that it cannot fit any of current categories. Maybe we can add...

Interesting! I see the use case. Could you share your fork?

Sorry I just relocated to a new place and has a lot of things to deal with. I'll come back and reconsider this feature afterwards. Thanks for your patience!

This can be resolved by using some asynchronous fs module like `tokio::fs` to avoid read the whole chunk into memory. I'll check it soon.

You are right. We may leverage tokio's stream read to overcome this issue. Unfortunately I am relocating to a new place recently. Will come back to look into this once...