I Fairly know about FFT, its an algorithm of DFT.

As the argmin suggests Writing computational complexity in Big O isn't great here.

since we generally see the interms of no.of complex additions and no.of Multiplications in the FFT algorithm.