MIT Introduction to algorithms 03 Lecture 03 Divide and Conquer Strassen Fibonacci Polynomial Multiplication mp4

MIT Introduction to algorithms
03 Lecture 03 Divide and Conquer Strassen Fibonacci Polynomial Multiplication mp4

Name	[MIT] Introduction to algorithms	DOWNLOAD Copy Link Trouble downloading? see How To
Total Size	4.0 GB
Total Files	74
Hash	A9047E30A76CFE2D1CD056FEA9D7817BAF4FEB9A

/1-03 Lecture 03 Divide-and-Conquer. Strassen, Fibonacci, Polynomial Multiplication.mp4	150.1 MB
/Lecture Notes 3 Divide-and-Conquer. Strassen, Fibonacci, Polynomial Multiplication.pdf	335.1 KB
/1-13 Lecture 13 Amortized Algorithms, Table Doubling, Potential Method.mp4	174.6 MB
/1-06 Lecture 06 Order Statistics, Median.mp4	151.1 MB
/1-10 Lecture 10 Red-black Trees, Rotations, Insertions, Deletions.mp4	183.2 MB
/1-04 Lecture 04 Quicksort, Randomized Algorithms.mp4	175.8 MB
/1-05 Lecture 05 Linear-time Sorting. Lower Bounds, Counting Sort, Radix Sort.mp4	168.4 MB
/1-07 Lecture 07 Hashing, Hash Functions.mp4	171.9 MB
/1-08 Lecture 08 Universal Hashing, Perfect Hashing.mp4	175.0 MB
/1-09 Lecture 09 Relation of BSTs to Quicksort, Analysis of Random BST.mp4	177.9 MB
/1-15 Lecture 15 Dynamic Programming, Longest Common Subsequence.mp4	154.6 MB
/1-23 Lecture 25 Advanced Topics (cont.), Discussion of Follow-on Classes.mp4	187.6 MB
/1-01 Lecture 01 Analysis of Algorithms, Insertion Sort, Mergesort.mp4	175.0 MB
/1-14 Lecture 14 Competitive Analysis. Self-organizing Lists.mp4	162.9 MB
/1-16 Lecture 16 Greedy Algorithms, Minimum Spanning Trees.mp4	180.9 MB
Showing first 15 files of 74 total files