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.cpp #68

Merged
merged 1 commit into from
Oct 11, 2022
Merged

Merge_Sort_Algorithm.cpp #68

merged 1 commit into from
Oct 11, 2022

Conversation

aanya963
Copy link
Contributor

@aanya963 aanya963 commented Oct 11, 2022

Description

I have solved the Merge Sort problem, using recursion and array. Merge Sort uses to sort the array, by splitting the array into halves and recursively invoking the merge sort on each of the halves.

Type of Changes

Type
🐛 Bug fix
✨ New feature
🔨 Refactoring
💯 Add tests
🔗 Update dependencies
📜 Docs

Testing Steps / QA Criteria

I have used recursion and array to solve this problem.
@DugarRishab
Copy link
Owner

Please mention the issue.

Copy link
Owner

@DugarRishab DugarRishab left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

okay cool.

Copy link
Owner

@DugarRishab DugarRishab left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

At least your code is tall.

@DugarRishab DugarRishab merged commit 6c6a9c6 into DugarRishab:main Oct 11, 2022
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.

2 participants