Thursday, July 16, 2009

MIT's Introduction to Algorithms, Lectur

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.ht



SEARCH THE WWW


Search 280+ Video Sites "UPGRADED "


[ CATEGORIES ]