Add implementations for more algorithms and data structures.

[bhavinjawade]

Add more algorithms and data structures to the repository, that are not already present.
Also add the explanation for the algorithms in markdown format.

[mephi007]

Hey I would like to contribute, can you please assign this to me?

[BassCoder2808]

I have identified some data structures which are missing ?

1. AVL tree
2. B-Tree
   I would like to contribute to the above mentioned Data Structures.
   Can you please assign the same this to me ?

[amit-syadav]

Can I add sorting algorithms like merge, quick, counting, bubble? Or Sieve of Eratosthenes?

[EmAchieng]

I would love to work on Linkedlists :)

[amitkrishna]

Hi @bhavinjawade I would like to take up Implementation of Prim's MST Algorithm Implementation using python

[bhavinjawade]

@mephi007

Hey I would like to contribute, can you please assign this to me?

Please suggest the algorithm or DS that you would like to the repository. I will create a new issue particularly for it and assign it to you.

Thanks.

[bhavinjawade]

@BassCoder2808

I have identified some data structures which are missing ?
AVL tree
B-Tree
I would like to contribute to the above mentioned Data Structures.
Can you please assign the same this to me ?

Sounds good. Go ahead with this. I am creating an issue for this and assigning it to you.

Please reply to the following issue: #11, so that I can assign it to you.

Thanks

[BassCoder2808]

Thank! I will start working on it.

[bhavinjawade]

Can I add sorting algorithms like merge, quick, counting, bubble? Or Sieve of Eratosthenes?

@amit-syadav,
Go ahead with Sieve of Eratosthenes.
Why not go about like: writing codes of finding prime with sieve of eratosthenes, sieve of atlkins and the segmented sieve
and then in your markdown, along with explanation for codes, compare the 3 sieves and explain why one is better than the other.

Let me know how that sounds. I will create an issue and assign it to you if that works for you.

Thanks.

[jayitsaha]

I would like to work on DP problems majorly Longest Palindromic Subsequence and Bitonic Sequence Algorithms.

[Ishita-0112]

I would love to add the famous problem of Unbounded Knapsack using Dynamic Programming and add Rod Cutting Problem and Coin Change Problem as it's two important variations. If you would kindly assign me to the issue.