A recently introduced algorithm for the fast computation of the discrete Fourier transform ,called conjugate pair fast Fourier transform (CPFFT),seemed to require a smaller number of real multiplications and additions than that required for the split radix (SR) FFT algorithm.Here it is shown that the CPFFT is the same as the SRFFT algorithm from the arithmetic complexity point of view.