A proof of the Kuzmak-Kogelman-Keller algorithm in the simplest, non-t
rivial case is given and it contains the essential steps required in p
roofs of more complicated ones. The motivation is to produce error bou
nds such that the approximation produced by the algorithm is ''good''
on a useful interval of the independent variable.