# Is there an equation for efficiency of a 2-radix FFT as you raise $k$?

I know the efficiency for an $N$ point 2-radix FFT is $N\log_2(N)$ but assuming $k\leq N$, what if you were looking for the efficiency of calculating $k$ positions of the FFT? Would the efficiency be $k\log_2(N)$?

For $k \ll N$ the Goertzel algorithm is typically the better choice. See https://en.wikipedia.org/wiki/Goertzel_algorithm. The break even point is quite small. Maybe $k = 4\cdot log_2(N)$ or thereabouts.