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 (Parallel Computing) #813

Open
tatticoder opened this issue Oct 25, 2020 · 1 comment
Open

Merge sort (Parallel Computing) #813

tatticoder opened this issue Oct 25, 2020 · 1 comment

Comments

@tatticoder
Copy link
Contributor

🚀 Feature

Merge sort is a fast algorithm but it can be further enhanced by creating a new thread for each subproblem and computing them at same time. This issue is not similar to #5

Have you read the Contribution Guidelines?

Yes

Pitch

This algorithm would take advantage of multiple cores in systems and reduce computation time.

@tatticoder
Copy link
Contributor Author

I would like to work on this in C++

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

1 participant