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 Merge Sort Algorithm in Java #1684

Merged
merged 1 commit into from
Oct 1, 2022
Merged

Added Merge Sort Algorithm in Java #1684

merged 1 commit into from
Oct 1, 2022

Conversation

LiQuiD-404
Copy link
Contributor

Problem

Sorting of arrays takes O(n^2)

Solution

Implemented an efficient sorting algorithm which takes O(NlogN) time.

Worked on this under Hacktoberfest.

@fineanmol fineanmol merged commit 51571ac into fineanmol:master Oct 1, 2022
@fineanmol
Copy link
Owner

@LiQuiD-404 Please Star ⭐️ the repo to earn "hacktober-accepted" label for the event.

@LiQuiD-404
Copy link
Contributor Author

@fineanmol Already done. Please add the tag. Thanks

@LiQuiD-404
Copy link
Contributor Author

image

@fineanmol fineanmol added the hacktoberfest-accepted Accept for hacktoberfest, will merge later label Oct 1, 2022
@LiQuiD-404
Copy link
Contributor Author

image
Why does it say this? @fineanmol

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
hacktoberfest-accepted Accept for hacktoberfest, will merge later
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants