HI everybody,
I'm wondering what will be more efficient.
Let's say I have p processors (so i can use p processes working
parallel).
I need to create a merge sort so I got two options:
1) Divide the array to half each time and give each process a half
when it's possible.
2) Divide the array to n/p sections when every process need to sort
each section.
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
