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 sorting algorithms like quick sort and merge sort #577

Closed
wants to merge 2 commits into from

Conversation

Mayank-tech69
Copy link

Implemented Merge Sort and Quick Sort algorithms, which are widely used for sorting large datasets efficiently.

Copy link
Member

@czgdp1807 czgdp1807 left a comment

Choose a reason for hiding this comment

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

Thank you for the contributions but we have these algorithms already,

def merge_sort_parallel(array, num_threads, **kwargs):

def quick_sort(array: Array, **kwargs) -> Array:

@czgdp1807 czgdp1807 closed this Jan 25, 2025
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