CS 332: Algorithms

Merge Sort

Merge Sort: Example

Analysis of Merge Sort

Recurrences

Recurrence Examples

Solving Recurrences

s(n) =

So far for n >= k we have

s(n)

PPT Slide

The Master Theorem

Using The Master Method

Email: luebke@cs.virginia.edu

Home Page: http://www.cs.virginia.edu/~luebke

Other information: CS 551: Intro Computer Graphics David Luebke, UVA

Download presentation source