Programming Parallel Computers 2019

Exercise MF: median filter

Hints

Make sure that you use a fast selection algorithm to find the median. Do not sort; quickselect and other good selection algorithms are much faster than sorting, and there is already a good implementation in the C++ standard library, so you do not need to reinvent it.

Hints for MF9a

Here are some examples of possible techniques that you can use to solve task MF9a: