From 2c129e97a1176fab18dab57efabf592be93be1d8 Mon Sep 17 00:00:00 2001
From: Darko <darko@icosahedron.dummy.porta.siemens.net>
Date: Wed, 4 Mar 2015 20:56:48 +0100
Subject: [PATCH] Add comments.

---
 ms.h | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/ms.h b/ms.h
index 7e2f366..018589c 100644
--- a/ms.h
+++ b/ms.h
@@ -8,10 +8,21 @@
 #include <string.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[]);
 
+/* Sort arr of size len using mergesort.
+ */
 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);
 
 #endif