poljakowski/mergesort
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Add comments.

Browse source
This commit is contained in:
Darko 2015-03-04 20:56:48 +01:00
parent 5bca484555
commit 2c129e97a1
1 changed files with 11 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

11
ms.h
View file

@ -8,10 +8,21 @@
#include <string.h> #include <string.h>
#include <sys/wait.h> #include <sys/wait.h>
/* Merge arrays left and right into res array.
*/
void mymerge(int left[], size_t leftlen, int right[], size_t rightlen, int res[]); void mymerge(int left[], size_t leftlen, int right[], size_t rightlen, int res[]);
/* Sort arr of size len using mergesort.
*/
int mymergesort(int arr[], size_t len); int mymergesort(int arr[], size_t len);
/* Sort arr of size len using mergesort.
* This function uses parallel processes for sorting.
* It is implemented by forking new process for right
* part of array. New child is forked only if
* current subarray len is less or equal than original
* array len / cnt parameter.
*/
int mymergesortp(int arr[], size_t len, int cnt); int mymergesortp(int arr[], size_t len, int cnt);
#endif #endif