In this paper we develop a discretized version of the dynamic programming algorithm and study its convergence and stability properties. We show that the computed value function converges quadratically to the true value function and that the computed policy function converges linearly, as the mesh size of the discretization converges to zero; further, the algorithm is stable. We also discuss several aspects of the implementation of our procedures as applied to some commonly studied growth models.