An efficient algorithm for choosing the degree of a polynomial to approximate discrete nonoscillatory data

An efficient algorithm for selecting the degree of a polynomial that defines a curve that best approximates a data set was presented. This algorithm was applied to both oscillatory and nonoscillatory data without loss of generality.