[informit.com] - Algorithms. 24-part Lecture Series (by Robert Sedgewick, Kevin Wayne 2015)

File Name

Size

Introduction/01. Algorithms. Introduction.mp4

45 MB

Lecture 1. Union-Find/01. Dynamic Connectivity.mp4

50 MB

Lecture 1. Union-Find/02. Quick Find.mp4

50 MB

Lecture 1. Union-Find/03. Quick Union.mp4

37 MB

Lecture 1. Union-Find/04. Quick-union Improvements.mp4

63 MB

Lecture 1. Union-Find/05. Union-find Applications.mp4

45 MB

Lecture 10. Geometric Applications of BSTs/01. Range Search-1.mp4

36 MB

Lecture 10. Geometric Applications of BSTs/02. Line Segment Intersection-2.mp4

24 MB

Lecture 10. Geometric Applications of BSTs/03. Kd-trees-3.mp4

125 MB

Lecture 10. Geometric Applications of BSTs/04. Interval Search Trees-4.mp4

58 MB

Lecture 10. Geometric Applications of BSTs/05. Rectangle Intersection-5.mp4

37 MB

Lecture 11. Hash Tables/01. Hash Functions.mp4

81 MB

Lecture 11. Hash Tables/02. Separate Chaining.mp4

33 MB

Lecture 11. Hash Tables/03. Linear Probing.mp4

56 MB

Lecture 11. Hash Tables/04. Context.mp4

46 MB

Lecture 11. Hash Tables/05. Sets.mp4

23 MB

Lecture 11. Hash Tables/06. Dictionary Clients.mp4

27 MB

Lecture 11. Hash Tables/07. Indexing Clients.mp4

35 MB

Lecture 11. Hash Tables/08. Sparse Vectors.mp4

34 MB

Lecture 12. Undirected Graphs/01. Introduction To Graphs.mp4

42 MB

Lecture 12. Undirected Graphs/02. Graph Api.mp4

67 MB

Lecture 12. Undirected Graphs/03. Depth-first Search.mp4

112 MB

Lecture 12. Undirected Graphs/04. Breadth-first Search.mp4

56 MB

Lecture 12. Undirected Graphs/05. Connected Components.mp4

76 MB

Lecture 12. Undirected Graphs/06. Graph Challenges.mp4

66 MB

Lecture 13. Directed Graphs/01. Introduction To Digraphs.mp4

37 MB

Lecture 13. Directed Graphs/02. Digraph Api.mp4

21 MB

Lecture 13. Directed Graphs/03. Digraph Search.mp4

90 MB

Lecture 13. Directed Graphs/04. Topological Sort.mp4

50 MB

Lecture 13. Directed Graphs/05. Strong Components.mp4

84 MB

Lecture 14. Minimum Spanning Trees/01. Introduction To Msts.mp4

18 MB

Lecture 14. Minimum Spanning Trees/02. Greedy Algorithm.mp4

54 MB

Lecture 14. Minimum Spanning Trees/03. Edge-weighted Graph Api.mp4

48 MB

Lecture 14. Minimum Spanning Trees/04. Kruskals Algorithm.mp4

53 MB

Lecture 14. Minimum Spanning Trees/05. Prims Algorithm.mp4

146 MB

Lecture 14. Minimum Spanning Trees/06. Mst Context.mp4

46 MB

Lecture 15. Shortest Paths/01. Shortest Paths Apis.mp4

47 MB

Lecture 15. Shortest Paths/02. Shortest Path Properties.mp4

67 MB

Lecture 15. Shortest Paths/03. Dijkstras Algorithm.mp4

84 MB

Lecture 15. Shortest Paths/04. Edge-weighted Dags.mp4

85 MB

Lecture 15. Shortest Paths/05. Negative Weights.mp4

88 MB

Lecture 16. Maximum Flow and Minimum Cut/01. Introduction To Maxflow.mp4

45 MB

Lecture 16. Maximum Flow and Minimum Cut/02. Ford-fulkerson Algorithm.mp4

26 MB

Lecture 16. Maximum Flow and Minimum Cut/03. Maxflow-mincut Theorem.mp4

42 MB

Lecture 16. Maximum Flow and Minimum Cut/04. Running Time Analysis.mp4

40 MB

Lecture 16. Maximum Flow and Minimum Cut/05. Java Implementation.mp4

66 MB

Lecture 16. Maximum Flow and Minimum Cut/06. Maxflow Applications.mp4

102 MB

Lecture 17. Radix Sorts/01. Strings In Java.mp4

78 MB

Lecture 17. Radix Sorts/02. Key-indexed Counting.mp4

55 MB

Lecture 17. Radix Sorts/03. Lsd Radix Sort.mp4

70 MB

Lecture 17. Radix Sorts/04. Msd Radix Sort.mp4

63 MB

Lecture 17. Radix Sorts/05. 3-way Radix Quicksort.mp4

33 MB

Lecture 17. Radix Sorts/06. Suffix Arrays.mp4

88 MB

Lecture 18. Tries/01. R-way Tries.mp4

127 MB

Lecture 18. Tries/02. Ternary Search Tries.mp4

84 MB

Lecture 18. Tries/03. Character-based Operations.mp4

93 MB

Lecture 19. Substring Search/01. Introduction To Substring Search.mp4

28 MB

Lecture 19. Substring Search/02. Brute-force Substring Search.mp4

43 MB

Lecture 19. Substring Search/03. Knuth-morris-pratt.mp4

136 MB

Lecture 19. Substring Search/04. Boyer-moore.mp4

34 MB

Lecture 19. Substring Search/05. Rabin-karp.mp4

75 MB

Lecture 2. Analysis of Algorithms/01 Introduction To Analysis Of Algorithms.mp4

39 MB

Lecture 2. Analysis of Algorithms/02. Observations.mp4

43 MB

Lecture 2. Analysis of Algorithms/03. Mathematical Models.mp4

59 MB

Lecture 2. Analysis of Algorithms/04. Order-of-growth Classifications.mp4

67 MB

Lecture 2. Analysis of Algorithms/05. Theory Of Algorithms.mp4

53 MB

Lecture 2. Analysis of Algorithms/06. Memory.mp4

38 MB

Lecture 20. Regular Expressions/01. Regular Expressions.mp4

91 MB

Lecture 20. Regular Expressions/02. Res And Nfas.mp4

61 MB

Lecture 20. Regular Expressions/03. Nfa Simulation.mp4

76 MB

Lecture 20. Regular Expressions/04. Nfa Construction.mp4

46 MB

Lecture 20. Regular Expressions/05. Regular Expression Applications.mp4

94 MB

Lecture 21. Data Compression/01. Introduction To Data Compression.mp4

104 MB

Lecture 21. Data Compression/02. Run-length Coding.mp4

28 MB

Lecture 21. Data Compression/03. Huffman Compression.mp4

101 MB

Lecture 21. Data Compression/04. Lzw Compression.mp4

105 MB

Lecture 22. Reductions/01. Introduction To Reductions.mp4

43 MB

Lecture 22. Reductions/02. Designing Algorithms.mp4

36 MB

Lecture 22. Reductions/03. Establishing Lower Bounds.mp4

44 MB

Lecture 22. Reductions/04. Classifying Problems.mp4

56 MB

Lecture 23. Linear Programming/01. Brewer's Problem.mp4

93 MB

Lecture 23. Linear Programming/02. Simplex Algorithm.mp4

54 MB

Lecture 23. Linear Programming/03. Simplex Implementations.mp4

76 MB

Lecture 23. Linear Programming/04. Linear Programming Reductions.mp4

56 MB

Lecture 24. Intractability/01. Introduction To Intractability.mp4

82 MB

Lecture 24. Intractability/02. Search Problems.mp4

52 MB

Lecture 24. Intractability/03. P Vs Np.mp4

77 MB

Lecture 24. Intractability/04. Classifying Problems.mp4

63 MB

Lecture 24. Intractability/05. Np-completeness.mp4

58 MB

Lecture 24. Intractability/06. Coping With Intractability.mp4

63 MB

Lecture 3. Stacks and Queues/01. Stacks.mp4

79 MB

Lecture 3. Stacks and Queues/02. Resizing Arrays.mp4

48 MB

Lecture 3. Stacks and Queues/03. Queues.mp4

22 MB

Lecture 3. Stacks and Queues/04. Generics.mp4

45 MB

Lecture 3. Stacks and Queues/05. Iterators.mp4

35 MB

Lecture 3. Stacks and Queues/06. Stack And Queue Applications.mp4

64 MB

Lecture 4. Elementary Sorts/01. Introduction To Sorting.mp4

68 MB

Lecture 4. Elementary Sorts/02. Selection Sort.mp4

31 MB

Lecture 4. Elementary Sorts/03. Insertion Sort.mp4

41 MB

Lecture 4. Elementary Sorts/04. Shellsort.mp4

44 MB

Lecture 4. Elementary Sorts/05. Shuffling.mp4

31 MB

Lecture 4. Elementary Sorts/06. Convex Hull.mp4

62 MB

Lecture 5. Mergesort/01. Mergesort.mp4

104 MB

Lecture 5. Mergesort/02. Bottom-up Mergesort.mp4

14 MB

Lecture 5. Mergesort/03. Sorting Complexity.mp4

39 MB

Lecture 5. Mergesort/04. Comparators.mp4

31 MB

Lecture 5. Mergesort/05. Stability.mp4

25 MB

Lecture 6. Quicksort/01. Quicksort.mp4

85 MB

Lecture 6. Quicksort/02. Selection.mp4

33 MB

Lecture 6. Quicksort/03. Duplicate Keys.mp4

50 MB

Lecture 6. Quicksort/04. System Sorts.mp4

55 MB

Lecture 7. Priority Queues/01. Apis And Elementary Implementations.mp4

57 MB

Lecture 7. Priority Queues/02. Binary Heaps.mp4

107 MB

Lecture 7. Priority Queues/03. Heapsort.mp4

58 MB

Lecture 7. Priority Queues/04. Event-driven Simulation.mp4

107 MB

Lecture 8. Elementary Symbol Tables/01. Symbol Table Apis.mp4

101 MB

Lecture 8. Elementary Symbol Tables/02. Elementary Implementations.mp4

42 MB

Lecture 8. Elementary Symbol Tables/03. Ordered Operations.mp4

29 MB

Lecture 8. Elementary Symbol Tables/04. Binary Search Trees.mp4

83 MB

Lecture 8. Elementary Symbol Tables/05. Ordered Operations In Bsts.mp4

46 MB

Lecture 8. Elementary Symbol Tables/06. Deletion In Bsts.mp4

46 MB

Lecture 9. Balanced Search Trees/01. Search Trees-1.mp4

69 MB

Lecture 9. Balanced Search Trees/02. Red-black Bsts-2.mp4

156 MB

Lecture 9. Balanced Search Trees/03. B-trees-3.mp4

49 MB

Algorithms_9780134384436_FullOutline_Readings_08-2015.pdf

212 kB