589689.xyz

[Coursera] Algorithms I

  • 收录时间:2018-04-01 23:02:05
  • 文件大小:2GB
  • 下载次数:185
  • 最近下载:2021-01-18 06:11:01
  • 磁力链接:
立即下载 复制链接

文件列表

  1. 31 - 1 - Kd-Trees (29_07).mp4 54MB
  2. 11 - 3 - Kd-Trees (29_07).mp4 54MB
  3. 15 - 1 - Red-Black BSTs (35_30).mp4 53MB
  4. 10 - 2 - Red-Black BSTs (35_30).mp4 53MB
  5. 40 - 1 - Event-Driven Simulation (22_38) (optional).mp4 39MB
  6. 8 - 4 - Event-Driven Simulation (22_38) (optional).mp4 39MB
  7. 6 - 1 - Mergesort (23_54).mp4 34MB
  8. 12 - 1 - Mergesort (23_54).mp4 34MB
  9. 8 - 2 - Binary Heaps (23_36).mp4 33MB
  10. 18 - 1 - Binary Heaps (23_36).mp4 33MB
  11. 11 - 1 - Symbol Table API (21_30).mp4 33MB
  12. 9 - 1 - Symbol Table API (21_30).mp4 33MB
  13. 9 - 1 - Symbol Table API (21_30)(1).mp4 33MB
  14. 3 - 1 - Quicksort (19_33).mp4 29MB
  15. 7 - 1 - Quicksort (19_33).mp4 29MB
  16. 9 - 4 - Binary Search Trees (19_56).mp4 28MB
  17. 34 - 1 - Binary Search Trees (19_56).mp4 28MB
  18. 9 - 4 - Binary Search Trees (19_56)(1).mp4 28MB
  19. 5 - 1 - Hash Functions (18_13).mp4 25MB
  20. 12 - 1 - Hash Functions (18_13).mp4 25MB
  21. 4 - 1 - Stacks (16_24).mp4 25MB
  22. 1 - 1 - Stacks (16_24).mp4 25MB
  23. 2 - 1 - 2-3 Search Trees (16_55).mp4 25MB
  24. 10 - 1 - 2-3 Search Trees (16_55).mp4 25MB
  25. 36 - 1 - Quick-Union Improvements (13_02).mp4 22MB
  26. 2 - 4 - Quick-Union Improvements (1302).mp4 22MB
  27. 5 - 6 - Convex Hull (13_50).mp4 21MB
  28. 56 - 1 - Convex Hull (13_50).mp4 21MB
  29. 4 - 6 - Stack and Queue Applications (13_25) (optional) .mp4 21MB
  30. 55 - 1 - Stack and Queue Applications (13_25) (optional) .mp4 21MB
  31. 8 - 3 - Heapsort (14_29).mp4 20MB
  32. 29 - 1 - Heapsort (14_29).mp4 20MB
  33. 7 - 1 - Sorting Introduction (14_43).mp4 20MB
  34. 5 - 1 - Sorting Introduction (14_43).mp4 20MB
  35. 28 - 1 - Linear Probing (14_37).mp4 20MB
  36. 12 - 3 - Linear Probing (14_37).mp4 20MB
  37. 8 - 1 - APIs and Elementary Implementations (12_52).mp4 20MB
  38. 6 - 1 - APIs and Elementary Implementations (12_52).mp4 20MB
  39. 2 - 5 - Union-Find Applications (922).mp4 20MB
  40. 48 - 1 - Union-Find Applications (9_22).mp4 20MB
  41. 3 - 3 - Mathematical Models (12_48).mp4 20MB
  42. 32 - 1 - Mathematical Models (12_48).mp4 20MB
  43. 22 - 1 - Quick Find (10_18).mp4 19MB
  44. 2 - 2 - Quick Find (1018).mp4 19MB
  45. 42 - 1 - Order-of-Growth Classifications (14_39).mp4 19MB
  46. 3 - 4 - Order-of-Growth Classifications (14_39).mp4 19MB
  47. 37 - 1 - System Sorts (11_50).mp4 19MB
  48. 7 - 4 - System Sorts (11_50).mp4 19MB
  49. 44 - 1 - Theory of Algorithms (11_35).mp4 19MB
  50. 41 - 1 - Interval Search Trees (13_47).mp4 19MB
  51. 11 - 4 - Interval Search Trees (13_47).mp4 19MB
  52. 7 - 3 - Duplicate Keys (11_25).mp4 18MB
  53. 26 - 1 - Duplicate Keys (11_25).mp4 18MB
  54. 10 - 3 - B-Trees (10_36).mp4 18MB
  55. 27 - 1 - B-Trees (10_36).mp4 18MB
  56. 7 - 1 - Course Introduction (9_22).mp4 16MB
  57. 4 - 2 - Resizing Arrays (9_56).mp4 16MB
  58. 22 - 1 - Resizing Arrays (9_56).mp4 16MB
  59. 53 - 1 - Deletion in BSTs (9_52).mp4 16MB
  60. 9 - 6 - Deletion in BSTs (9_52).mp4 16MB
  61. 9 - 6 - Deletion in BSTs (9_52)(1).mp4 16MB
  62. 2 - 1 - Dynamic Connectivity (1022).mp4 16MB
  63. 3 - 1 - Dynamic Connectivity (10_22).mp4 16MB
  64. 4 - 4 - Generics (9_26).mp4 15MB
  65. 36 - 1 - Generics (9_26).mp4 15MB
  66. 5 - 4 - Shellsort (10_48).mp4 15MB
  67. 39 - 1 - Shellsort (10_48).mp4 15MB
  68. 3 - 2 - Observations (10_05).mp4 14MB
  69. 20 - 1 - Observations (10_05).mp4 14MB
  70. 12 - 4 - Hash Table Context (10_09).mp4 14MB
  71. 38 - 1 - Hash Table Context (10_09).mp4 14MB
  72. 51 - 1 - Ordered Operations in BSTs (10_31).mp4 14MB
  73. 9 - 5 - Ordered Operations in BSTs (10_31)(1).mp4 14MB
  74. 9 - 5 - Ordered Operations in BSTs (10_31).mp4 14MB
  75. 5 - 3 - Insertion Sort (9_28).mp4 14MB
  76. 29 - 1 - Insertion Sort (9_28).mp4 14MB
  77. 23 - 2 - Sorting Complexity (9_05).mp4 14MB
  78. 6 - 3 - Sorting Complexity (9_05).mp4 14MB
  79. 10 - 1 - Analysis of Algorithms Introduction (8_14).mp4 13MB
  80. 3 - 1 - Analysis of Algorithms Introduction (8_14).mp4 13MB
  81. 9 - 2 - Elementary Implementations (9_03)(1).mp4 13MB
  82. 20 - 1 - Elementary Implementations (9_03).mp4 13MB
  83. 9 - 2 - Elementary Implementations (9_03).mp4 13MB
  84. AlgorithmsFourthEdition.pdf 13MB
  85. 11 - 1 - 1d Range Search (8_51).mp4 13MB
  86. 9 - 1 - 1d Range Search (8_51).mp4 13MB
  87. 52 - 1 - Memory (8_11).mp4 12MB
  88. 3 - 6 - Memory (8_11).mp4 12MB
  89. 11 - 5 - Rectangle Intersection (8_10).mp4 12MB
  90. 47 - 1 - Rectangle Intersection (8_10).mp4 12MB
  91. 5 - 5 - Shuffling (7_39).mp4 12MB
  92. 50 - 1 - Shuffling (7_39).mp4 12MB
  93. 7 - 2 - Selection (7_08).mp4 12MB
  94. 14 - 1 - Selection (7_08).mp4 12MB
  95. 12 - 8 - Symbol Table Applications_ Sparse Vectors (7_41) (optional).mp4 11MB
  96. 57 - 2 - Symbol Table Applications_ Sparse Vectors (7_41) (optional).mp4 11MB
  97. 4 - 5 - Iterators (7_16).mp4 11MB
  98. 46 - 1 - Iterators (7_16).mp4 11MB
  99. 25 - 1 - Quick Union (7_50).mp4 11MB
  100. 2 - 3 - Quick Union (750).mp4 11MB
  101. 12 - 2 - Separate Chaining (7_28).mp4 10MB
  102. 16 - 1 - Separate Chaining (7_28).mp4 10MB
  103. 17 - 1 - Selection Sort (6_59).mp4 10MB
  104. 5 - 2 - Selection Sort (6_59).mp4 10MB
  105. 34 - 2 - Comparators (6_43).mp4 10MB
  106. 6 - 4 - Comparators (6_43).mp4 10MB
  107. 9 - 3 - Ordered Operations (6_26).mp4 10MB
  108. 33 - 1 - Ordered Operations (6_26).mp4 10MB
  109. 9 - 3 - Ordered Operations (6_26)(1).mp4 10MB
  110. 57 - 1 - Symbol Table Applications_ Indexing Clients (8_57) (optional).mp4 9MB
  111. 12 - 7 - Symbol Table Applications_ Indexing Clients (8_57) (optional).mp4 9MB
  112. 6 - 5 - Stability (5_39).mp4 9MB
  113. 46 - 1 - Stability (5_39).mp4 9MB
  114. 12 - 6 - Symbol Table Applications_ Dictionary Clients (5_40) (optional).mp4 8MB
  115. 54 - 1 - Symbol Table Applications_ Dictionary Clients (5_40) (optional).mp4 8MB
  116. 11 - 2 - Line Segment Intersection (5_46).mp4 8MB
  117. 19 - 1 - Line Segment Intersection (5_46).mp4 8MB
  118. 24 - 1 - Queues (4_33).mp4 8MB
  119. 4 - 3 - Queues (4_33).mp4 8MB
  120. 47 - 1 - Symbol Table Applications_ Sets (5_04) (optional).mp4 8MB
  121. 12 - 5 - Symbol Table Applications_ Sets (5_04) (optional).mp4 8MB
  122. 23 - 1 - Bottom-up Mergesort (3_20).mp4 5MB
  123. 6 - 2 - Bottom-up Mergesort (3_20).mp4 5MB
  124. 15 - 1 - Red-Black BSTs (35_30).srt 39KB
  125. 12 - 1 - Mergesort (23_54).srt 31KB
  126. 31 - 1 - Kd-Trees (29_07).srt 31KB
  127. 18 - 1 - Binary Heaps (23_36).srt 28KB
  128. 42 - 1 - Event-Driven Simulation (22_38) (optional).srt 26KB
  129. 3 - 1 - Quicksort (19_33).srt 26KB
  130. 11 - 1 - Symbol Table API (21_30).srt 24KB
  131. 43 - 1 - Binary Search Trees (19_56).srt 23KB
  132. 2 - 1 - 2-3 Search Trees (16_55).srt 21KB
  133. 5 - 1 - Hash Functions (18_13).srt 21KB
  134. 1 - 1 - Stacks (16_24).srt 19KB
  135. 30 - 1 - Heapsort (14_29).srt 17KB
  136. 7 - 1 - Sorting Introduction (14_43).srt 17KB
  137. 42 - 1 - Order-of-Growth Classifications (14_39).srt 16KB
  138. 56 - 1 - Convex Hull (13_50).srt 16KB
  139. 28 - 1 - Linear Probing (14_37).srt 16KB
  140. 6 - 1 - APIs and Elementary Implementations (12_52).srt 15KB
  141. 41 - 1 - Interval Search Trees (13_47).srt 15KB
  142. 54 - 1 - Stack and Queue Applications (13_25) (optional) .srt 14KB
  143. 32 - 1 - Mathematical Models (12_48).srt 14KB
  144. 36 - 1 - Quick-Union Improvements (13_02).srt 14KB
  145. 37 - 1 - System Sorts (11_50).srt 14KB
  146. 45 - 1 - Theory of Algorithms (11_35).srt 13KB
  147. 26 - 1 - Duplicate Keys (11_25).srt 13KB
  148. 39 - 1 - Shellsort (10_48).srt 12KB
  149. 4 - 1 - Dynamic Connectivity (10_22).srt 12KB
  150. 8 - 1 - Course Introduction (9_22).srt 12KB
  151. 27 - 1 - B-Trees (10_36).srt 12KB
  152. 40 - 1 - Hash Table Context (10_09).srt 12KB
  153. 51 - 1 - Ordered Operations in BSTs (10_31).srt 12KB
  154. 13 - 1 - Resizing Arrays (9_56).srt 12KB
  155. 53 - 1 - Deletion in BSTs (9_52).srt 11KB
  156. 22 - 1 - Quick Find (10_18).srt 11KB
  157. 34 - 1 - Sorting Complexity (9_05).srt 11KB
  158. 47 - 1 - Union-Find Applications (9_22).srt 11KB
  159. 29 - 1 - Insertion Sort (9_28).srt 11KB
  160. 20 - 1 - Observations (10_05).srt 10KB
  161. 21 - 1 - Elementary Implementations (9_03).srt 10KB
  162. 10 - 1 - Analysis of Algorithms Introduction (8_14).srt 10KB
  163. 9 - 1 - 1d Range Search (8_51).srt 10KB
  164. 35 - 1 - Generics (9_26).srt 10KB
  165. 57 - 1 - Symbol Table Applications_ Indexing Clients (8_57) (optional).srt 10KB
  166. 49 - 1 - Rectangle Intersection (8_10).srt 10KB
  167. 52 - 1 - Memory (8_11).srt 9KB
  168. 16 - 1 - Separate Chaining (7_28).srt 8KB
  169. 14 - 1 - Selection (7_08).srt 8KB
  170. 57 - 2 - Symbol Table Applications_ Sparse Vectors (7_41) (optional).srt 8KB
  171. 48 - 1 - Shuffling (7_39).srt 8KB
  172. 25 - 1 - Quick Union (7_50).srt 8KB
  173. 34 - 2 - Comparators (6_43).srt 8KB
  174. 46 - 1 - Iterators (7_16).srt 8KB
  175. 17 - 1 - Selection Sort (6_59).srt 8KB
  176. 33 - 1 - Ordered Operations (6_26).srt 7KB
  177. 19 - 1 - Line Segment Intersection (5_46).srt 6KB
  178. 44 - 1 - Stability (5_39).srt 6KB
  179. 45 - 1 - Symbol Table Applications_ Sets (5_04) (optional).srt 6KB
  180. 54 - 1 - Symbol Table Applications_ Dictionary Clients (5_40) (optional).srt 6KB
  181. 24 - 1 - Queues (4_33).srt 5KB
  182. 12 - 2 - Bottom-up Mergesort (3_20).srt 4KB
  183. 3 - 5 - Theory of Algorithms (11_35).mp4 0B