Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Adding Mege sort and Quick Sort (Divide And Conquer Algorithms) in python #2010

Open
robinsingh-ai opened this issue May 26, 2021 · 1 comment

Comments

@robinsingh-ai
Copy link

Is your feature request related to a problem? Please describe.
Hey @rish-singhal I would like to add two major sorting algorithms like Quick Sort and Merge Sort based on Divide and Conquer approach in python language

Describe the solution you'd like
A clear and concise description of what you want to happen.

Do you want to work on it
Yes
I will implement this in python language

Kindly Assign me this under GSSOC 21
Thank you

@robinsingh-ai
Copy link
Author

hey @rish-singhal assign me this issue if its available

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant