Why FFT algorithm (Cooley-Tukey) takes O(nlogn)?

1.6k Views Asked by At

I was wondering how this algorithm can be formally interpreted with an upper bound n*log(n). There's some formal proof for this? I would appreciate if somebody can help me. Thank you.