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

Added the code of Merge Sort #413

Open
wants to merge 1 commit into
base: main
Choose a base branch
from

Conversation

KunjMaheshwari
Copy link

Resolved Issue #401

MergeSort Algorithm - Merge sort is a sorting algorithm that follows the divide-and-conquer approach. It works by recursively dividing the input array into smaller subarrays and sorting those subarrays then merging them back together to obtain the sorted array.
Time complexity - O(nlogn)

@KunjMaheshwari
Copy link
Author

I’ve resolved issue #401 in my pull request, and this is my first contribution to open source. I would greatly appreciate your review and consideration for merging it. Thank you!

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

Successfully merging this pull request may close these issues.

1 participant