I would like it is pseudo code. that way i can use it in any language.

Given a set P of n points in consider the problem of finding the ball with smallest radius containing all the points in P. Show that the following is a 2-approximation algorithm for this problem. Pick a point x elementof P, and set d to be the distance of the farthest point in P from x. Output the ball centered at x with radius d