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

Merge Sort algorithm implementation #49

Open
suzan-rana opened this issue Oct 4, 2023 · 4 comments
Open

Merge Sort algorithm implementation #49

suzan-rana opened this issue Oct 4, 2023 · 4 comments

Comments

@suzan-rana
Copy link

Hello, I would like to contribute by implementing a merge sort algorithm, an algorithm that follows divide and conquer strategy, having time complexity as O(n log n)

@suzan-rana
Copy link
Author

@puruagarwal1 please assign this to me, I would like to contribute

@Jugnu-Gupta
Copy link

@puruagarwal1 please assign this task to me,
i have good knowledge of DSA.
Merge sort is based on divide and conquer.

@saku1331
Copy link

saku1331 commented Oct 6, 2023

I wish to contribute. Kindly assign this to me.

@Pritee668
Copy link

please assign this to me

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

4 participants