Build-a-Figure, Parks-McClellan Algorithm
Figures 7.49 page 568
This Build-a-Figure reproduces Figure 7.49 which shows the how the Parks-McClellan algorithm iterates to select the frequencies for the extrema. Your program will initially assume the frequencies are equally spaced. Each iteration will compute the new d value and then move each frequency to the nearest local minimum or maximum.
