I just recently learned the Ham Sandwich Theorem in my algebraic topology class. If we take the measure to be the counting measure and let $n=2$, then the theorem tells us that given a set of black and white points in the plane, we can draw a line that'll divide the plane so that there is an equal number of black and white points on either side of the line. But this theorem is existential only. Is there an algorithm for actually computing the line for this discrete case? If so, what's the complexity?
The paper by Lo, Matoušek, and Steiger entitled "Algorithms for HamSandwich Cuts" gives an $O(n)$ algorithm, where $n$ is the number of points. That's the best you can do, since you need to consider all such points. 

