1 / 8

Lecture 30

Lecture 30. CSE 331 Nov 13, 2009. To be strictly enforced. For the rest of the semester on Fridays. SUBMIT. your. HOMEWORKS. by. 1:10 PM. At the end of the lecture. Graded HW 7 and HW 9. On Jaynee’s order. Reminder: Resignation deadline is today. Divide and Conquer.

zanna
Download Presentation

Lecture 30

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 30 CSE 331 Nov 13, 2009

  2. To be strictly enforced For the rest of the semester on Fridays SUBMIT your HOMEWORKS by 1:10 PM

  3. At the end of the lecture Graded HW 7 and HW 9

  4. On Jaynee’s order Reminder: Resignation deadline is today

  5. Divide and Conquer Divide up the problem into at least two sub-problems Recursively solve the sub-problems “Patch up” the solutions to the sub-problems for the final solution

  6. Improvements on a smaller scale Greedy algorithms: exponential  poly time Divide and Conquer: O(n2)  asymptotically smaller running time

  7. Multiplying two numbers Given two numbers a and b as binary a=(an-1,..,a0) and b = (bn-1,…,b0) Running time of primary school algorithm? Compute c = a x b

  8. To be strictly enforced For the rest of the semester on Fridays SUBMIT your HOMEWORKS by 1:10 PM

More Related