Index of /courseware/Introduction To Algorithms

	Name	Last modified	Size	Description
	Parent Directory		-
	L1 - Analysis of Algorithms, Insertion Sort, Mergesort.rm	02-May-2010 20:02	129M
	L2 - Asymptotic Notation , Recurrences , Substitution , Master Method.rm	02-May-2010 20:00	113M
	L3 - Divide-and-Conquer Strassen, Fibonacci, Polynomial Multiplication.rm	02-May-2010 19:59	110M
	L4 - Quicksort, Randomized Algorithms.rm	02-May-2010 19:59	129M
	L5 - Linear-time Sorting Lower Bounds, Counting Sort, Radix Sort.rm	02-May-2010 19:59	123M
	L6 - Order Statistics, Median.rm	02-May-2010 19:59	110M
	L7 - Hashing, Hash Functions.rm	02-May-2010 19:58	124M
	L8 - Universal Hashing, Perfect Hashing.rm	02-May-2010 19:58	127M
	L9 - Relation of BSTs to Quicksort , Analysis Of Random BST.rm	02-May-2010 19:58	130M
	L10-Red-black Trees, Rotations, Insertions, Deletions.rm	02-May-2010 20:02	134M
	L11-Augmenting Data Structures, Dynamic Order Statistics, Interval Trees.rm	02-May-2010 20:02	134M
	L12-Skip Lists.rm	02-May-2010 20:02	137M
	L13-Amortized Algorithms, Table Doubling, Potential Method.rm	02-May-2010 20:01	127M
	L14-Competitive Analysis Self-organizing Lists.rm	02-May-2010 20:01	119M
	L15-Dynamic Programming, Longest Common Subsequence.rm	02-May-2010 20:01	114M
	L16-Greedy Algorithms, Minimum Spanning Trees.rm	02-May-2010 20:01	135M
	L17-Shortest Paths I Properties, Dijkstra's Algorithm, Breadth-first Search.rm	02-May-2010 20:01	135M
	L18-Shortest Paths II Bellman-Ford, Linear Programming, Difference Constraints.rm	02-May-2010 20:01	124M
	L19-Shortest Paths III All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson.rm	02-May-2010 20:00	120M
	L22-Advanced Topics.rm	02-May-2010 20:00	120M
	L23-Advanced Topics (cont.).rm	02-May-2010 20:00	122M
	L24-Advanced Topics (cont.).rm	02-May-2010 19:59	136M
	L25-Advanced Topics (cont.) , Discussion of Follow-on Classes.rm	02-May-2010 19:59	137M