***** With modern cache management in processors, there is no more any significative  *****
***** speed difference between FFT algorithm implementations 1, 2, 3, 4 or 5.         *****

Of course the algorithm 0 (any N) is significantly slower especially
when the number of points not a power of 2 and especially a multiple large prime numbers factors.