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 #12

Open
shanvijha30 opened this issue Oct 3, 2023 · 3 comments
Open

Merge Sort Algorithm #12

shanvijha30 opened this issue Oct 3, 2023 · 3 comments

Comments

@shanvijha30
Copy link

Merge sort is a recursive algorithm that continuously splits the array in half until it cannot be further divided i.e., the array has only one element left (an array with one element is always sorted). Then the sorted subarrays are merged into one sorted array.

@shanvijha30
Copy link
Author

@funway009 I would lie to work on this issue. Please assign it to me

@saku1331
Copy link

saku1331 commented Oct 4, 2023

I wish to contribute. Kindly assign this to me.

@urvashi-2004
Copy link

@funway009 I'd would like to work on this issue. 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

3 participants