-
Notifications
You must be signed in to change notification settings - Fork 0
saiharshavellanki/Concurrent-Merge-Sort
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
Input : integer n followed by n values Method: - Recursively make two child processes, one for the left half, one of the right half. If the number of elements in the array for a process is less than 5, perform a selection sort. - The parent of the two children then merges the result and returns back to the parent and so on.
About
Given n numbers, sort the numbers using merge sort concurrently
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published