Solved the sink problem with complexity n

It's also known as the celebrity problem.   The question is who is the one in a party who is known by other people but no one knows him?

It turns out that there is O(n) solution for this problem.  (The n^2 solution is rather trivial) I was able to think it through.

Good.  Sounds like I can check away another problem of CLRS.