Informit com Algorithms 24 part Lecture Series by Robert Sedgewick Kevin Wayne 2015

Informit com Algorithms 24 part Lecture Series by Robert Sedgewick Kevin Wayne 2015

Name	[informit.com] - Algorithms. 24-part Lecture Series (by Robert Sedgewick, Kevin Wayne 2015)	DOWNLOAD Copy Link Trouble downloading? see How To
Total Size	7.8 GB
Total Files	125
Hash	C6A6A4EAE3053F9D0E42DF4591B33C11F27EAD9A

/Introduction/
01. Algorithms. Introduction.mp4	46.9 MB
/Lecture 1. Union-Find/
01. Dynamic Connectivity.mp4	52.1 MB
02. Quick Find.mp4	52.3 MB
03. Quick Union.mp4	39.2 MB
04. Quick-union Improvements.mp4	65.8 MB
05. Union-find Applications.mp4	46.8 MB
/Lecture 10. Geometric Applications of BSTs/
01. Range Search-1.mp4	37.3 MB
02. Line Segment Intersection-2.mp4	25.6 MB
03. Kd-trees-3.mp4	131.5 MB
04. Interval Search Trees-4.mp4	61.2 MB
05. Rectangle Intersection-5.mp4	39.1 MB
/Lecture 11. Hash Tables/
01. Hash Functions.mp4	85.3 MB
02. Separate Chaining.mp4	34.8 MB
03. Linear Probing.mp4	59.3 MB
04. Context.mp4	47.7 MB
05. Sets.mp4	24.4 MB
06. Dictionary Clients.mp4	28.4 MB
07. Indexing Clients.mp4	37.0 MB
08. Sparse Vectors.mp4	35.1 MB
/Lecture 12. Undirected Graphs/
01. Introduction To Graphs.mp4	44.1 MB
02. Graph Api.mp4	70.4 MB
03. Depth-first Search.mp4	118.0 MB
04. Breadth-first Search.mp4	58.7 MB
05. Connected Components.mp4	79.2 MB
06. Graph Challenges.mp4	68.8 MB
/Lecture 13. Directed Graphs/
01. Introduction To Digraphs.mp4	38.5 MB
02. Digraph Api.mp4	22.0 MB
03. Digraph Search.mp4	94.2 MB
04. Topological Sort.mp4	52.2 MB
05. Strong Components.mp4	88.3 MB
/Lecture 14. Minimum Spanning Trees/
01. Introduction To Msts.mp4	19.4 MB
02. Greedy Algorithm.mp4	56.6 MB
03. Edge-weighted Graph Api.mp4	50.7 MB
04. Kruskals Algorithm.mp4	55.9 MB
05. Prims Algorithm.mp4	152.9 MB
06. Mst Context.mp4	48.5 MB
/Lecture 15. Shortest Paths/
01. Shortest Paths Apis.mp4	49.2 MB
02. Shortest Path Properties.mp4	70.0 MB
03. Dijkstras Algorithm.mp4	88.0 MB
04. Edge-weighted Dags.mp4	88.9 MB
05. Negative Weights.mp4	92.2 MB
/Lecture 16. Maximum Flow and Minimum Cut/
01. Introduction To Maxflow.mp4	47.2 MB
02. Ford-fulkerson Algorithm.mp4	27.4 MB
03. Maxflow-mincut Theorem.mp4	44.3 MB
04. Running Time Analysis.mp4	42.2 MB
05. Java Implementation.mp4	69.0 MB
06. Maxflow Applications.mp4	107.3 MB
/Lecture 17. Radix Sorts/
01. Strings In Java.mp4	81.4 MB
02. Key-indexed Counting.mp4	57.4 MB
03. Lsd Radix Sort.mp4	73.7 MB
04. Msd Radix Sort.mp4	66.3 MB
05. 3-way Radix Quicksort.mp4	34.7 MB
06. Suffix Arrays.mp4	92.0 MB
/Lecture 18. Tries/
01. R-way Tries.mp4	133.3 MB
02. Ternary Search Tries.mp4	88.4 MB
03. Character-based Operations.mp4	97.8 MB
/Lecture 19. Substring Search/
01. Introduction To Substring Search.mp4	29.8 MB
02. Brute-force Substring Search.mp4	45.4 MB
03. Knuth-morris-pratt.mp4	143.1 MB
04. Boyer-moore.mp4	35.5 MB
05. Rabin-karp.mp4	78.6 MB
/Lecture 2. Analysis of Algorithms/
01 Introduction To Analysis Of Algorithms.mp4	41.2 MB
02. Observations.mp4	45.4 MB
03. Mathematical Models.mp4	61.7 MB
04. Order-of-growth Classifications.mp4	70.2 MB
05. Theory Of Algorithms.mp4	55.3 MB
06. Memory.mp4	40.3 MB
/Lecture 20. Regular Expressions/
01. Regular Expressions.mp4	95.7 MB
02. Res And Nfas.mp4	63.6 MB
03. Nfa Simulation.mp4	79.9 MB
04. Nfa Construction.mp4	47.9 MB
05. Regular Expression Applications.mp4	98.4 MB
/Lecture 21. Data Compression/
01. Introduction To Data Compression.mp4	108.9 MB
02. Run-length Coding.mp4	28.8 MB
03. Huffman Compression.mp4	106.0 MB
04. Lzw Compression.mp4	110.3 MB
/Lecture 22. Reductions/
01. Introduction To Reductions.mp4	45.1 MB
02. Designing Algorithms.mp4	37.7 MB
03. Establishing Lower Bounds.mp4	45.9 MB
04. Classifying Problems.mp4	58.9 MB
/Lecture 23. Linear Programming/
01. Brewer's Problem.mp4	97.1 MB
02. Simplex Algorithm.mp4	56.1 MB
03. Simplex Implementations.mp4	79.2 MB
04. Linear Programming Reductions.mp4	58.8 MB
/Lecture 24. Intractability/
01. Introduction To Intractability.mp4	85.9 MB
02. Search Problems.mp4	54.6 MB
03. P Vs Np.mp4	81.0 MB
04. Classifying Problems.mp4	65.9 MB
05. Np-completeness.mp4	61.3 MB
06. Coping With Intractability.mp4	65.9 MB
/Lecture 3. Stacks and Queues/
01. Stacks.mp4	82.9 MB
02. Resizing Arrays.mp4	49.8 MB
03. Queues.mp4	22.7 MB
04. Generics.mp4	47.4 MB
05. Iterators.mp4	36.4 MB
06. Stack And Queue Applications.mp4	67.4 MB
/Lecture 4. Elementary Sorts/
01. Introduction To Sorting.mp4	71.0 MB
02. Selection Sort.mp4	32.4 MB
03. Insertion Sort.mp4	43.3 MB
04. Shellsort.mp4	46.0 MB
05. Shuffling.mp4	32.3 MB
06. Convex Hull.mp4	65.4 MB
/Lecture 5. Mergesort/
01. Mergesort.mp4	109.4 MB
02. Bottom-up Mergesort.mp4	15.2 MB
03. Sorting Complexity.mp4	40.8 MB
04. Comparators.mp4	33.0 MB
05. Stability.mp4	25.9 MB
/Lecture 6. Quicksort/
01. Quicksort.mp4	88.9 MB
02. Selection.mp4	34.7 MB
03. Duplicate Keys.mp4	51.9 MB
04. System Sorts.mp4	57.3 MB
/Lecture 7. Priority Queues/
01. Apis And Elementary Implementations.mp4	60.0 MB
02. Binary Heaps.mp4	112.4 MB
03. Heapsort.mp4	60.5 MB
04. Event-driven Simulation.mp4	111.9 MB
/Lecture 8. Elementary Symbol Tables/
01. Symbol Table Apis.mp4	105.6 MB
02. Elementary Implementations.mp4	44.1 MB
03. Ordered Operations.mp4	30.2 MB
04. Binary Search Trees.mp4	86.9 MB
05. Ordered Operations In Bsts.mp4	47.8 MB
06. Deletion In Bsts.mp4	47.7 MB
/Lecture 9. Balanced Search Trees/
01. Search Trees-1.mp4	72.8 MB
02. Red-black Bsts-2.mp4	164.1 MB
03. B-trees-3.mp4	51.2 MB
/
Algorithms_9780134384436_FullOutline_Readings_08-2015.pdf	217.5 KB
Total files 125