Videos

MIT's Introduction to Algorithms, Lecture 01 (visit www.catonmat.net for notes)

Posted by Metric Clay on September 2, 2009 at 10:18am

Get Embed Code

<embed id="VideoPlayback" src="http://video.google.com/googleplayer.swf?docid=-2333306016564732003&amp;hl=en&amp;fs=true" style="width:400px;height:326px" allowscriptaccess="never" type="application/x-shockwave-flash"></embed>

www.catonmat.net, for, notes, 01, Lecture

1:20:36 - 1 year agoVisit http://www.catonmat.net for transcription of this lecture and lecture notes. Lecture 1: Analysis of algorithms. Sorting. Insertion sort. Running time of insertion sort. Kinds of running time analysis. Asymptotic analysis. Merge sort. Recurrence for merge sort. Recursion tree. Ps. MIT OCW lectures are released under CC license, so I had all the legal rights to upload them to Google Video. For more information visit: http://ocw.mit.edu/OcwWeb/web/terms/terms/index.htm

You need to be a member of Peacepink3 to add comments!

Join Peacepink3

★

Votes: 0

E-mail me when people leave their comments –

#xg { position:relative;top:120px; } #xn_bar { top:120px; }

Hello, you need to enable JavaScript to use Peacepink3.

Please check your browser settings or contact your system administrator.

Comments