This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: task and get same value in t1. 3. Using the functions t1 and t2 as guidelines, implement the function t3 corresponding to a divide-and-conquer algorithm where you have 2 subproblems, each of size n/2 (using linear time for dividing and combining solutions). Implement the function t4 similarly, but with 4 subproblems each of size n/4. 4. Give the recurrence relation for each of t1, t2, t3 and t4. 5. What is the solution of each recurrence relation in part 4 (you may use asymptotic notation)? Function t1 t2 t3 t4 Solution 6. Give print out of the results. Tasks: 1) Hand in the function t0. 2) Hand in the function t3. 3) Hand in the function t4. 4) Hand in the output of step 6. 5) Hand in recurrence relation from step 4. 6) Hand in the table of step 5....
View Full Document
- Spring '10