MIT Introduction to algorithms 13 Lecture 13 Amortized Algorithms Table Doubling Potential Method mp4

MIT Introduction to algorithms
13 Lecture 13 Amortized Algorithms Table Doubling Potential Method 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-13 Lecture 13 Amortized Algorithms, Table Doubling, Potential Method.mp4	174.6 MB
/Lecture Notes 13 Amortized Algorithms, Table Doubling, Potential Method.pdf	303.6 KB
/1-16 Lecture 16 Greedy Algorithms, Minimum Spanning Trees.mp4	180.9 MB
/1-01 Lecture 01 Analysis of Algorithms, Insertion Sort, Mergesort.mp4	175.0 MB
/1-08 Lecture 08 Universal Hashing, Perfect Hashing.mp4	175.0 MB
/1-04 Lecture 04 Quicksort, Randomized Algorithms.mp4	175.8 MB
/1-10 Lecture 10 Red-black Trees, Rotations, Insertions, Deletions.mp4	183.2 MB
/1-14 Lecture 14 Competitive Analysis. Self-organizing Lists.mp4	162.9 MB
/1-21 Lecture 23 Advanced Topics (cont.).mp4	169.1 MB
/1-02 Lecture 02 Asymptotic Notation, Recurrences, Substitution, Master Method.mp4	152.8 MB
/1-06 Lecture 06 Order Statistics, Median.mp4	151.1 MB
/1-15 Lecture 15 Dynamic Programming, Longest Common Subsequence.mp4	154.6 MB
/1-22 Lecture 24 Advanced Topics (cont.).mp4	186.2 MB
/1-07 Lecture 07 Hashing, Hash Functions.mp4	171.9 MB
/1-23 Lecture 25 Advanced Topics (cont.), Discussion of Follow-on Classes.mp4	187.6 MB
Showing first 15 files of 74 total files