Posted by: atri | September 18, 2011

Lect 8: Runtime Analysis

On Friday, we saw how to analyze the run time of an algorithms to get both O(\cdot) and \Omega(\cdot) bounds. You might find this earlier blog post useful too.

The slides have been uploaded.

Below are links to the student posts for the lecture:

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: