Possible Duplicate:
Code to calculate “median of five” in C#
Suppose I have five numbers in a list, say [3,2,1,4,5].
How do I find the median with 6 comparisons?
Asked
Active
Viewed 8,614 times
2
Community
- 1
- 1
dangerChihuahua007
- 18,433
- 28
- 104
- 190
-
Is this homework? It smells like homework. If it is, tag it so. – Amadan Jan 10 '12 at 15:00
-
2No, it isn't. I'm learning algorithms on my own :) I'm on winter break right now. – dangerChihuahua007 Jan 10 '12 at 15:01
-
Why the specific number of comparisons? I don't know any sorting algorithm with O(n) performance. – GazTheDestroyer Jan 10 '12 at 15:04
-
Specific for specifically 5-element list. It's a puzzle. – Amadan Jan 10 '12 at 15:05
-
Wow, that question did it, thanks! Yeah, I think we can close this question if it overlaps with that question. I just wanted to know how to program it. – dangerChihuahua007 Jan 10 '12 at 15:11
1 Answers
2
Take an optimal sorting network for N=5 which requires 9 comparisons and then prune the unneeded comparisons for outputs 0, 1, 3 and 4. There's an example of this which uses 6 comparisons in the answer to this question.
