Compute the median element of an unsorted integer array. For this, you will have to:

1. Sort the array: implement any sorting algorithm you wish. At this link you will find a series of searching algorithms, each implemented in its own C file.
2. Eliminate the duplicates: once the array is sorted, eliminating the duplicates is trivial. The array operations discussed, and more, can be found at this reference.
3. Select the (n+1)/2th element.
4. Write unittests to validate your implementation.