Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
The time complexity to multiply two polynomials of degree n using Fast Fourier transform method is:
1
θ(n lg n)
2
θ(n2)
3
θ(n)
4
θ(lg n)