Computer Science · Algorithms
Using the Fast Fourier Transform (FFT), what is the time complexity for multiplying two polynomials A(x) and B(x) of degree bound n, where the input and output representations are in coefficient form and n is a power of 2?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(log2n)
- 2O(2n)
- 3O(n log2n)✓
- 4O(n2)
Correct answer
O(n log2n)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms