Papex

Open problem · Computer science · Open

Smallest and fastest median selection networks

For each number of inputs n, how few comparators, and how few layers, can a comparator network have that always leaves the median of its n inputs on a fixed wire?

Summary

A median selection network is a comparator network that need not sort its inputs but always leaves the median on the middle wire (for an even number of inputs, the two middle values on the two middle wires). B. Dobbelaere keeps a list of the smallest and fastest median networks known; it gives no lower bounds for most sizes.

Source

Open, as listed by B. Dobbelaere, list of median networks · Median selection networks. Checked 19 Nov 2026.

The status is the source’s. Papex does not decide whether a problem is solved.

Records on this problem

No public record addresses this problem yet.

More in Computing