med_fb

void median(int i, int width, int height, int* inBuffer, int* outBuffer)
{
vector<int> niz;
for (int j = 1; j < height - 1; j++)
{
// naredne dve petlje realizuju formulu dvostruke sume iz prateceg dokumenta
for (int m = -1; m <= 1; m++)
{
for (int n = -1; n <= 1; n++)
{
niz.push_back(inBuffer[(j + n) * width + (i + m)]);
//outBuffer[j * width + i] += inBuffer[(j + n) * width + (i + m)] / 9;

}
}
sort(niz.begin(), niz.end());
outBuffer[j * width + i]=niz[4];
niz.clear();
}
}

void filter_parallel_med(int* inBuffer, int* outBuffer, int width, int height)
{
// TODO: PLACE CODE HERE
for (int i = 1; i < width - 1; i ++)
{
cilk_spawn median(i, width, height, inBuffer, outBuffer);
}
cilk_sync;
}