Implementation is more or less "median of medians" approach as described in wiki page :
https://en.wikipedia.org/wiki/Median_of_medians
Project use template to implement it and it works with various types (int 4, int 8, float, double).
At the beginning of main.cpp, there are few lines that control test parameters.
Tests compare results from 3 algorithms (std::sort, qsort, and mine) and dump execution time for each.
There are tests in "test" dir, which are performed on my machine (params in cpu.txt).
Also some interesting plots over same data, X axis is count of data elements, Y is time to find median.
Red is "median of medians" algorithm, blue is std::sort way, black is qsort way.

Project can be build on windows & linux. 

compile on linux 64 bit with :
=================================================
"make debug" executable is in "./debug" dir
"make release" executable is in "./release" dir
"make clean" cleans debug & release


