Abstract
An upper bound asymptotic to $2n_e n$ is established for the number of comparators required in a network that classifies n values into two classes, each containing $n / 2$ values, with each value in one class less than or equal to each value in the other. (The best lower bound known for this problem is asymptotic to $(n / 2)_2 n$.)
Users
Please
log in to take part in the discussion (add own reviews or comments).