To seek a smallest circle containing all the point of a given point set is an interesting problem in both practice and theory. In this paper, an algorithm of finding a smallest circle containing all the points given is presented. The time complexity of the algorithm is O(|lg(d/R)|*n), where R is the radius between the smallest circle, d is the smallest distance between the points of the set that are not on the circle and the circle.