26 Jul
2004
26 Jul
'04
12:14 p.m.
Any Knuth sorting network can be implemented by means of min & max. At 09:16 AM 7/26/2004, Marc LeBrun wrote:
For distinct a,b,c you can express their median using min, max and arithmetic operators by
a + b + c - min(a,b,c) - max(a,b,c)
Can you construct something elegant for a,b,c,d,e?