* - Otherwise, the array is split in 2 parts based on the mean of X and sent to 2 different paralell child processes. The parent watches for the return code of the children and terminates with an error if any of the children exit with anything other than success.
* - Otherwise, the array is split in 2 parts based on the mean of X and sent to 2 different paralell child processes.
* The parent watches for the return code of the children and terminates with an error if any of the children exit
* with anything other than success.
*
*
* Algorithm description when there are more than 2 points:
* Algorithm description when there are more than 2 points:
* - P1 and P2 are the closest pairs for the first and the second part respectively.
* - P1 and P2 are the closest pairs for the first and the second part respectively.
...
@@ -44,18 +46,24 @@
...
@@ -44,18 +46,24 @@
/// Node struct for linked list
/// Node struct for linked list
typedefstructnode{
typedefstructnode{
/**
* points[0] - contains the X coordinate of the point
* points[1] - contains the Y coordinate of the point