This preview shows page 1. Sign up to view the full content.
Unformatted text preview: sorting? Explain in a sentence. Q1e. What is the spacecomplexity (memory needed) of Quick sort? ( Think! ) Explain in a sentence. Q2. Evaluate a polynomial 4 + 3x + 2x 2 + x 3 at w 4 , w 4 2 , w 4 3 , and w 4 4 , four complex roots of the equation x 4 =1, using recursive FFT algorithm. Show the recurrence tree and your steps. How many steps (complexity) are there in your computation? [20 pts]...
View
Full
Document
This note was uploaded on 02/10/2012 for the course CSE 5211 taught by Professor Dmitra during the Spring '12 term at FIT.
 Spring '12
 Dmitra
 Algorithms

Click to edit the document details