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.

Sign up for GitHub

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

Jump to bottom

How is a merge sort algorithm implemented? #69

Open
mohitmishra786 opened this issue Oct 1, 2022 · 2 comments
Open

How is a merge sort algorithm implemented? #69

mohitmishra786 opened this issue Oct 1, 2022 · 2 comments
Labels
hacktober-fest Made for Hacktoberfest 2022 hacktoberfest Made for Hacktoberfest 2022 hacktoberfest-accepted

Comments

@mohitmishra786
Copy link
Owner

How is a merge sort algorithm implemented?
@mohitmishra786 mohitmishra786 added hacktoberfest Made for Hacktoberfest 2022 hacktoberfest-accepted hacktober-fest Made for Hacktoberfest 2022 labels Oct 1, 2022
@ArSin2002
Copy link
Contributor

merge sort algorithm works on divide and conquer approach in which first the array is divided into subarrays and and then sorted one after another . can I provide the code for it in python @mohitmishra786 ???

@mohitmishra786
Copy link
Owner Author

@ArSin2002 yes

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
hacktober-fest Made for Hacktoberfest 2022 hacktoberfest Made for Hacktoberfest 2022 hacktoberfest-accepted
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@mohitmishra786 @ArSin2002