I'm amazed how many interviewees can't even properly explain binary search, down to saying "linked list" as the base data structure.
I would enjoy reading a logically correct implementation of a binary search on a linked list. Discussing the performance complexity would be an obvious next question in the interview.
http://en.wikipedia.org/wiki/Schlemiel_the_Painters_algorith...