A simple algorithm is described for obtaining approximations to a given function, by means of straight line segments, with any pre-assigned accuracy. The approximation obtained is a best one in the minimax sense. Secondly, given the number of segments k another algorithm finds the best approximation by means of k segments.