This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: return a b a 1 = a n1 ,…,a [n/2] and a = a [n/2]1 ,…, a Compute b 1 and b from b Mult ( a , b ) Let p = Mult ( x , y ), D = Mult ( a 1 , b 1 ), E = Mult ( a , b ) T(1) ≤ c T(n) ≤ 3T(n/2) + cn O(n log 3 ) = O(n 1.59 ) run time O(n log 3 ) = O(n 1.59 ) run time (Old) Reading Assignment Sec 5.2 of [KT] Rankings How close are two rankings? Rest of today’s agenda Formal problem: Counting inversions Divide and Conquer algorithm Divide and Conquer Divide up the problem into at least two subproblems Recursively solve the subproblems “Patch up” the solutions to the subproblems for the final solution Solve all subproblems: Mergesort Solve some subproblems: Multiplication Solve stronger subproblems: Inversions...
View
Full Document
 Fall '11
 RUDRA
 Multiplication, Divide and conquer algorithm, Multiplication Algorithm, conquer multiplication algorithm, Online Office Hr, an12n1+ an22n2+…+ a12+

Click to edit the document details