title: closest pair algorithm
body: <p>I am trying to understand the closest pair algorithm.  I understand about dividing the set in half.  But I am having trouble understanding how to recursively compute the closest pair.  I understand recursion, but do not understand how to compute the closest pair by recursion.  If you have (1,2)(1,11)(7,8) how would recursion work on these?</p>