Fastest way of finding the middle value of a triple?

by

There’s an answer here using min/max and no branches (https://stackoverflow.com/a/14676309/2233603). Actually 4 min/max operations are enough to find the median, there’s no need for xor’s:

median = max(min(a,b), min(max(a,b),c));

Though, it won’t give you the median value’s index…

Breakdown of all cases:

a b c
1 2 3   max(min(1,2), min(max(1,2),3)) = max(1, min(2,3)) = max(1, 2) = 2
1 3 2   max(min(1,3), min(max(1,3),2)) = max(1, min(3,2)) = max(1, 2) = 2
2 1 3   max(min(2,1), min(max(2,1),3)) = max(1, min(2,3)) = max(1, 2) = 2
2 3 1   max(min(2,3), min(max(2,3),1)) = max(2, min(3,1)) = max(2, 1) = 2
3 1 2   max(min(3,1), min(max(3,1),2)) = max(1, min(3,2)) = max(1, 2) = 2
3 2 1   max(min(3,2), min(max(3,2),1)) = max(2, min(3,1)) = max(2, 1) = 2

More Related Contents:

  1. Java while loop query [closed]
  2. How to approach this hackerrank puzzle?
  3. How to make a 4×4 sudoku solver in java [closed]
  4. Is it 2 character search possible in lucence
  5. Java: check if array is heap
  6. O(3^n) exponential time complexity [closed]
  7. Why does Java’s hashCode() in String use 31 as a multiplier?
  8. Sparse matrices / arrays in Java
  9. Quickest way to find missing number in an array of numbers
  10. Calculating all of the subsets of a set of numbers
  11. How to convert a byte array to its numeric value (Java)?
  12. Iteratively compute the Cartesian product of an arbitrary number of sets
  13. Iteration order of HashSet
  14. Find duplicate element in array in time O(n)
  15. Algorithm for finding all paths in a NxN grid
  16. print directory tree
  17. Most efficient way to see if an ArrayList contains an object in Java
  18. Sample Directed Graph and Topological Sort Code [closed]
  19. Lossless JPEG Rotate (90/180/270 degrees) in Java?
  20. Randomly Generate Letters According to their Frequency of Use?
  21. How to reliably detect file types? [duplicate]
  22. Most elegant way to change 0 to 1 and vice versa
  23. Find all numbers in the String [closed]
  24. find an element in a sorted matrix [duplicate]
  25. Java algorithm to make a straight pyramid [closed]
  26. Interview question – Search in sorted array X for index i such that X[i] = i
  27. How to implement a Median-heap
  28. How does this Google Maps zoom level calculation work?
  29. (a * b) / c MulDiv and dealing with overflow from intermediate multiplication
  30. Example of O(n!)?

Leave a Comment