Posted by: atri | November 9, 2012

Lect 29: Merge Sort

In today’s lecture, we started with the Divide and Conquer paradigm and started with our first example: the Merge Sort algorithm. We presented the algorithm and proved its correctness. Next lecture, we will see how to analyze its runtime. All this material is from Section 5.1 in the book.

The slides and notes have been uploaded.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: