Introduction to Algorithms - by MIT 2009
English | MP4 | XVID 290 kbps 15 fps | 320 x 240 | AAC 128 kbps 22 KHz Stereo | 3.68 GB
Genre: elearning

01 _ Administrivia/Introduction/Analysis of Algorithms Insertion Sort Mergesort
02 _ Asymptotic Notation/Recurrences/Substitution Master Method
03 _ Divide-and-Conquer: Strassen Fibonacci Polynomial Multiplication
04 _ Quicksort Randomized Algorithms
05 _ Linear-time Sorting: Lower Bounds Counting Sort Radix Sort
06 _ der Statistics Median
07 _ Hashing Hash Functions
08 _ Universal Hashing Perfect Hashing
09 _ Relation of BSTs to Quicksort/Analysis of Random BST
10 _ Red-black Trees Rotations Insertions Deletions
11 _ Augmenting Data Structures Dynamic der Statistics Interval Trees
12 _ Skip Lists
13 _ Amortized Algorithms Table Doubling Potential Method
14 _ Competitive Analysis: Self-organizing Lists
15 _ Dynamic Programming Longest Common Subsequence
16 _ Greedy Algorithms Minimum Spanning Trees
17 _ Shortest Paths I: Properties Dijkstra's Algorithm Breadth-first Search
18 _ Shortest Paths II: Bellman-Ford Linear Programming Difference Constraints
19 _ Shortest Paths III: All-pairs Shortest Paths Matrix Multiplication Floyd-Warshall Johnson
20 _ Advanced Topics
21 _ Advanced Topics (cont.)
22 _ Advanced Topics (cont.)
23 _ Advanced Topics (cont.)


Download from uploadstation.com

Download from wupload.com

Download from filesonic.com