INVCPU v1.00 PCB Test Suit.
System Core Clock = 120000000 Hz
Now. System ticks = 750131l, Sysytem time = 0.006251 s
Clock check. T1= 1440087l, T2= 1560069l, Delta(tick)= 119982l, Delta(s)= 0.0010
----------------------------------------------
Algorithm 'Qsort' (standart C library ):
----------------------------------------------
Results CRC = 7EC7
Number of samplles   = 65
Number of iterations = 6000
Measured max. number of cycles = 15054, time(us)=125.45
Measured min. number of cycles = 9369, time(us)=78.08
Measured aver.number of cycles = 12036, time(us)=100.30

----------------------------------------------
Algorithm 'Shell' (http://electronix.ru/forum/index.php?s=&showtopic=114436&view=findpost&p=1181687):
----------------------------------------------
Results CRC = 7EC7
Number of samplles   = 65
Number of iterations = 6000
Measured max. number of cycles = 6370, time(us)=53.08
Measured min. number of cycles = 3640, time(us)=30.33
Measured aver.number of cycles = 5454, time(us)=45.45

----------------------------------------------
Algorithm 'Select' (Numerical Recipes in C, 8.5 Selecting the Mth Largest p.341):
----------------------------------------------
Results CRC = 7EC7
Number of samplles   = 65
Number of iterations = 6000
Measured max. number of cycles = 3129, time(us)=26.07
Measured min. number of cycles = 834, time(us)=6.95
Measured aver.number of cycles = 1621, time(us)=13.51

----------------------------------------------
Algorithm 'Selip' (Numerical Recipes in C, 8.5 Selecting the Mth Largest p.343):
----------------------------------------------
Results CRC = 7EC7
Number of samplles   = 65
Number of iterations = 6000
Measured max. number of cycles = 15714, time(us)=130.95
Measured min. number of cycles = 2224, time(us)=18.53
Measured aver.number of cycles = 14548, time(us)=121.23

----------------------------------------------
Algorithm 'Xenia' (http://electronix.ru/forum/index.php?s=&showtopic=114436&view=findpost&p=1180687):
----------------------------------------------
Results CRC = 7EC7
Number of samplles   = 65
Number of iterations = 6000
Measured max. number of cycles = 21885, time(us)=182.38
Measured min. number of cycles = 930, time(us)=7.75
Measured aver.number of cycles = 10514, time(us)=87.62

----------------------------------------------
Algorithm 'Neiver' (http://electronix.ru/forum/index.php?s=&showtopic=114436&view=findpost&p=1180944):
----------------------------------------------
Results CRC = 7EC7
Number of samplles   = 65
Number of iterations = 6000
Measured max. number of cycles = 8009, time(us)=66.74
Measured min. number of cycles = 1512, time(us)=12.60
Measured aver.number of cycles = 1535, time(us)=12.79

----------------------------------------------
Algorithm 'Ekstrom' (http://embeddedgurus.com/stack-overflow/tag/median-filter/):
----------------------------------------------
Results CRC = 7EC7
Number of samplles   = 65
Number of iterations = 6000
Measured max. number of cycles = 1325, time(us)=11.04
Measured min. number of cycles = 1256, time(us)=10.47
Measured aver.number of cycles = 1265, time(us)=10.54

----------------------------------------------
Algorithm 'Klen' (http://electronix.ru/forum/index.php?s=&showtopic=114436&view=findpost&p=1180679)
----------------------------------------------
Results CRC = 7EC7
Number of samplles   = 65
Number of iterations = 6000
Measured max. number of cycles = 4405, time(us)=36.71
Measured min. number of cycles = 1595, time(us)=13.29
Measured aver.number of cycles = 2403, time(us)=20.02

int Median(const int *data, size_t size)
{
    int min, max, newMax, newMin;
    size_t middle = (size+1) / 2;
    min = max = data[0];
    for(size_t i = 0; i < size; i++)
    {
        max = std::max(data[i], max);
        min = std::min(data[i], min);
    }

    int medianCandidate;
    size_t less, more;
    do
    {
        medianCandidate = (min + max) / 2;
        more = less = 0;
        newMax = min;
        newMin = max;

        for(size_t i = 0; i < size; i++)
        {
            if(data[i] > medianCandidate)
            {
                more ++;
                if (data[i] < newMin)
                    newMin = data[i];
            }else if(data[i] < medianCandidate)
            {
                less ++;
                if (data[i] > newMax)
                    newMax = data[i];
            }
        }

        if (less <= middle && more <= middle)
            break;
        else if(less > middle)
        {            
            max = newMax;
        }
        else
        {
            min = newMin;
        }
    }
    while(max - min > 1);
    size_t equal = size - more - less;
    if (less >= middle) return newMax;
    else if (less + equal >= middle)
        return medianCandidate;
    else return newMin;
}

#define compGT(a, B ) (a > B )

//------------------------------------------------------------------------------
//! Медианный фильтр с сортировкой Шелла
//------------------------------------------------------------------------------
int Med_Shell_Sort(int *a, int ub){
int n, h, i, j;
int t;

// compute largest increment
n = ub + 1;
h = 1;
if (n < 14) h = 1;
else
if (sizeof(tblIndex) == 2 && n > 29524) h = 3280;
else
{
while (h < n) h = 3*h + 1;
h /= 3;
h /= 3;
}

while (h > 0)
{
// sort-by-insertion in increments of h
for (i = h; i < ub; i++)
{
t = a[i];
for (j = i-h; (j >= 0) && compGT(a[j], t); j -= h) a[j+h] = a[j];
a[j+h] = t;
}
// compute next increment
h /= 3;
}

return ((ub+1)/2);
}

typedef int tblIndex;