The Fast Fourier Transform (FFT) algorithm is based on efficiently computing the Discrete Fourier Transform (DFT) in different signal processing systems. It is an umbrella of different algorithms, with each having the capacity to perform relatively better than others depending on the scenario. This research was able to review and compare ten (10) FFT algorithms identifying strengths, weakness, and application using the stochastic method of comparison. The research summarized the findings in tabular form, thereby making it easy for researchers’’ select which FFT algorithm is most appropriate.