589689.xyz

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

  • 收录时间:2018-03-01 14:21:30
  • 文件大小:7GB
  • 下载次数:165
  • 最近下载:2021-01-20 06:31:02
  • 磁力链接:
立即下载 复制链接

文件列表

  1. Lecture 9. Balanced Search Trees/02. Red-black Bsts-2.mp4 157MB
  2. Lecture 14. Minimum Spanning Trees/05. Prims Algorithm.mp4 146MB
  3. Lecture 19. Substring Search/03. Knuth-morris-pratt.mp4 136MB
  4. Lecture 18. Tries/01. R-way Tries.mp4 127MB
  5. Lecture 10. Geometric Applications of BSTs/03. Kd-trees-3.mp4 125MB
  6. Lecture 12. Undirected Graphs/03. Depth-first Search.mp4 113MB
  7. Lecture 7. Priority Queues/02. Binary Heaps.mp4 107MB
  8. Lecture 7. Priority Queues/04. Event-driven Simulation.mp4 107MB
  9. Lecture 21. Data Compression/04. Lzw Compression.mp4 105MB
  10. Lecture 5. Mergesort/01. Mergesort.mp4 104MB
  11. Lecture 21. Data Compression/01. Introduction To Data Compression.mp4 104MB
  12. Lecture 16. Maximum Flow and Minimum Cut/06. Maxflow Applications.mp4 102MB
  13. Lecture 21. Data Compression/03. Huffman Compression.mp4 101MB
  14. Lecture 8. Elementary Symbol Tables/01. Symbol Table Apis.mp4 101MB
  15. Lecture 20. Regular Expressions/05. Regular Expression Applications.mp4 94MB
  16. Lecture 18. Tries/03. Character-based Operations.mp4 93MB
  17. Lecture 23. Linear Programming/01. Brewer's Problem.mp4 93MB
  18. Lecture 20. Regular Expressions/01. Regular Expressions.mp4 91MB
  19. Lecture 13. Directed Graphs/03. Digraph Search.mp4 90MB
  20. Lecture 15. Shortest Paths/05. Negative Weights.mp4 88MB
  21. Lecture 17. Radix Sorts/06. Suffix Arrays.mp4 88MB
  22. Lecture 15. Shortest Paths/04. Edge-weighted Dags.mp4 85MB
  23. Lecture 6. Quicksort/01. Quicksort.mp4 85MB
  24. Lecture 18. Tries/02. Ternary Search Tries.mp4 84MB
  25. Lecture 13. Directed Graphs/05. Strong Components.mp4 84MB
  26. Lecture 15. Shortest Paths/03. Dijkstras Algorithm.mp4 84MB
  27. Lecture 8. Elementary Symbol Tables/04. Binary Search Trees.mp4 83MB
  28. Lecture 24. Intractability/01. Introduction To Intractability.mp4 82MB
  29. Lecture 11. Hash Tables/01. Hash Functions.mp4 81MB
  30. Lecture 3. Stacks and Queues/01. Stacks.mp4 79MB
  31. Lecture 17. Radix Sorts/01. Strings In Java.mp4 78MB
  32. Lecture 24. Intractability/03. P Vs Np.mp4 77MB
  33. Lecture 20. Regular Expressions/03. Nfa Simulation.mp4 76MB
  34. Lecture 12. Undirected Graphs/05. Connected Components.mp4 76MB
  35. Lecture 23. Linear Programming/03. Simplex Implementations.mp4 76MB
  36. Lecture 19. Substring Search/05. Rabin-karp.mp4 75MB
  37. Lecture 17. Radix Sorts/03. Lsd Radix Sort.mp4 70MB
  38. Lecture 9. Balanced Search Trees/01. Search Trees-1.mp4 69MB
  39. Lecture 4. Elementary Sorts/01. Introduction To Sorting.mp4 68MB
  40. Lecture 12. Undirected Graphs/02. Graph Api.mp4 67MB
  41. Lecture 2. Analysis of Algorithms/04. Order-of-growth Classifications.mp4 67MB
  42. Lecture 15. Shortest Paths/02. Shortest Path Properties.mp4 67MB
  43. Lecture 16. Maximum Flow and Minimum Cut/05. Java Implementation.mp4 66MB
  44. Lecture 12. Undirected Graphs/06. Graph Challenges.mp4 66MB
  45. Lecture 3. Stacks and Queues/06. Stack And Queue Applications.mp4 64MB
  46. Lecture 17. Radix Sorts/04. Msd Radix Sort.mp4 63MB
  47. Lecture 24. Intractability/04. Classifying Problems.mp4 63MB
  48. Lecture 24. Intractability/06. Coping With Intractability.mp4 63MB
  49. Lecture 1. Union-Find/04. Quick-union Improvements.mp4 63MB
  50. Lecture 4. Elementary Sorts/06. Convex Hull.mp4 62MB
  51. Lecture 20. Regular Expressions/02. Res And Nfas.mp4 61MB
  52. Lecture 2. Analysis of Algorithms/03. Mathematical Models.mp4 59MB
  53. Lecture 24. Intractability/05. Np-completeness.mp4 59MB
  54. Lecture 10. Geometric Applications of BSTs/04. Interval Search Trees-4.mp4 58MB
  55. Lecture 7. Priority Queues/03. Heapsort.mp4 58MB
  56. Lecture 7. Priority Queues/01. Apis And Elementary Implementations.mp4 57MB
  57. Lecture 11. Hash Tables/03. Linear Probing.mp4 57MB
  58. Lecture 22. Reductions/04. Classifying Problems.mp4 56MB
  59. Lecture 23. Linear Programming/04. Linear Programming Reductions.mp4 56MB
  60. Lecture 12. Undirected Graphs/04. Breadth-first Search.mp4 56MB
  61. Lecture 17. Radix Sorts/02. Key-indexed Counting.mp4 55MB
  62. Lecture 6. Quicksort/04. System Sorts.mp4 55MB
  63. Lecture 14. Minimum Spanning Trees/02. Greedy Algorithm.mp4 54MB
  64. Lecture 23. Linear Programming/02. Simplex Algorithm.mp4 53MB
  65. Lecture 14. Minimum Spanning Trees/04. Kruskals Algorithm.mp4 53MB
  66. Lecture 2. Analysis of Algorithms/05. Theory Of Algorithms.mp4 53MB
  67. Lecture 24. Intractability/02. Search Problems.mp4 52MB
  68. Lecture 1. Union-Find/02. Quick Find.mp4 50MB
  69. Lecture 13. Directed Graphs/04. Topological Sort.mp4 50MB
  70. Lecture 1. Union-Find/01. Dynamic Connectivity.mp4 50MB
  71. Lecture 6. Quicksort/03. Duplicate Keys.mp4 49MB
  72. Lecture 9. Balanced Search Trees/03. B-trees-3.mp4 49MB
  73. Lecture 14. Minimum Spanning Trees/03. Edge-weighted Graph Api.mp4 48MB
  74. Lecture 3. Stacks and Queues/02. Resizing Arrays.mp4 48MB
  75. Lecture 15. Shortest Paths/01. Shortest Paths Apis.mp4 47MB
  76. Lecture 14. Minimum Spanning Trees/06. Mst Context.mp4 46MB
  77. Lecture 20. Regular Expressions/04. Nfa Construction.mp4 46MB
  78. Lecture 8. Elementary Symbol Tables/05. Ordered Operations In Bsts.mp4 46MB
  79. Lecture 8. Elementary Symbol Tables/06. Deletion In Bsts.mp4 46MB
  80. Lecture 11. Hash Tables/04. Context.mp4 46MB
  81. Lecture 3. Stacks and Queues/04. Generics.mp4 45MB
  82. Lecture 16. Maximum Flow and Minimum Cut/01. Introduction To Maxflow.mp4 45MB
  83. Introduction/01. Algorithms. Introduction.mp4 45MB
  84. Lecture 1. Union-Find/05. Union-find Applications.mp4 45MB
  85. Lecture 4. Elementary Sorts/04. Shellsort.mp4 44MB
  86. Lecture 22. Reductions/03. Establishing Lower Bounds.mp4 44MB
  87. Lecture 19. Substring Search/02. Brute-force Substring Search.mp4 43MB
  88. Lecture 2. Analysis of Algorithms/02. Observations.mp4 43MB
  89. Lecture 22. Reductions/01. Introduction To Reductions.mp4 43MB
  90. Lecture 16. Maximum Flow and Minimum Cut/03. Maxflow-mincut Theorem.mp4 42MB
  91. Lecture 12. Undirected Graphs/01. Introduction To Graphs.mp4 42MB
  92. Lecture 8. Elementary Symbol Tables/02. Elementary Implementations.mp4 42MB
  93. Lecture 4. Elementary Sorts/03. Insertion Sort.mp4 41MB
  94. Lecture 16. Maximum Flow and Minimum Cut/04. Running Time Analysis.mp4 40MB
  95. Lecture 2. Analysis of Algorithms/01 Introduction To Analysis Of Algorithms.mp4 39MB
  96. Lecture 5. Mergesort/03. Sorting Complexity.mp4 39MB
  97. Lecture 2. Analysis of Algorithms/06. Memory.mp4 38MB
  98. Lecture 1. Union-Find/03. Quick Union.mp4 37MB
  99. Lecture 10. Geometric Applications of BSTs/05. Rectangle Intersection-5.mp4 37MB
  100. Lecture 13. Directed Graphs/01. Introduction To Digraphs.mp4 37MB
  101. Lecture 22. Reductions/02. Designing Algorithms.mp4 36MB
  102. Lecture 10. Geometric Applications of BSTs/01. Range Search-1.mp4 36MB
  103. Lecture 11. Hash Tables/07. Indexing Clients.mp4 35MB
  104. Lecture 3. Stacks and Queues/05. Iterators.mp4 35MB
  105. Lecture 19. Substring Search/04. Boyer-moore.mp4 34MB
  106. Lecture 11. Hash Tables/08. Sparse Vectors.mp4 33MB
  107. Lecture 11. Hash Tables/02. Separate Chaining.mp4 33MB
  108. Lecture 17. Radix Sorts/05. 3-way Radix Quicksort.mp4 33MB
  109. Lecture 6. Quicksort/02. Selection.mp4 33MB
  110. Lecture 5. Mergesort/04. Comparators.mp4 31MB
  111. Lecture 4. Elementary Sorts/02. Selection Sort.mp4 31MB
  112. Lecture 4. Elementary Sorts/05. Shuffling.mp4 31MB
  113. Lecture 8. Elementary Symbol Tables/03. Ordered Operations.mp4 29MB
  114. Lecture 19. Substring Search/01. Introduction To Substring Search.mp4 28MB
  115. Lecture 21. Data Compression/02. Run-length Coding.mp4 27MB
  116. Lecture 11. Hash Tables/06. Dictionary Clients.mp4 27MB
  117. Lecture 16. Maximum Flow and Minimum Cut/02. Ford-fulkerson Algorithm.mp4 26MB
  118. Lecture 5. Mergesort/05. Stability.mp4 25MB
  119. Lecture 10. Geometric Applications of BSTs/02. Line Segment Intersection-2.mp4 24MB
  120. Lecture 11. Hash Tables/05. Sets.mp4 23MB
  121. Lecture 3. Stacks and Queues/03. Queues.mp4 22MB
  122. Lecture 13. Directed Graphs/02. Digraph Api.mp4 21MB
  123. Lecture 14. Minimum Spanning Trees/01. Introduction To Msts.mp4 18MB
  124. Lecture 5. Mergesort/02. Bottom-up Mergesort.mp4 15MB
  125. Algorithms_9780134384436_FullOutline_Readings_08-2015.pdf 212KB