1 / 11

Algorithms

Algorithms. Recurrences Continued The Master Method. The master method. Provides a cookbook method for solving recurrences of the form This is very convenient because divide and conquer algorithms have recurrences of the form. Divide and Conquer Algorithms.

catalina
Download Presentation

Algorithms

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. Algorithms Recurrences Continued The Master Method

  2. The master method • Provides a cookbook method for solving recurrences of the form • This is very convenient because divide and conquer algorithms have recurrences of the form

  3. Divide and Conquer Algorithms • The form of the master theorem is very convenient because divide and conquer algorithms have recurrences of the form

  4. Form of the Master Theorem • Combines D(n) and C(n) into f(n) • For example, in Merge-Sort • a=2 • b=2 • f(n)=(n) • We will ignore floors and ceilings. The proof of the Master Theorem includes a proof that this is ok.

  5. What does the master theorem say?

  6. Using the Master Method

  7. Using the Master Methodcontinued

  8. Using the Master Methodcontinued

  9. Alternative Form of the Master Method

  10. Alternative Form of the Master Method

More Related