589689.xyz

[] Udemy - algorithms-and-data-structures

  • 收录时间:2018-03-22 12:40:20
  • 文件大小:1GB
  • 下载次数:209
  • 最近下载:2021-01-02 10:46:32
  • 磁力链接:
立即下载 复制链接

文件列表

  1. 09 B-Trees/078 B-tree introduction - basics.mp4 29MB
  2. 08 Splay Trees/073 Splay tree introduction I - basics.mp4 27MB
  3. 03 Linked Lists/014 Linked list implementation II.mp4 24MB
  4. 07 Balanced Trees_ Red-Black Trees/057 Red-black trees introduction - basics.mp4 23MB
  5. 05 Binary Search Trees/030 Binary search trees theory - basics.mp4 23MB
  6. 07 Balanced Trees_ Red-Black Trees/070 Red-black tree implementation V - fixing the violations.mp4 22MB
  7. 06 Balanced Trees_ AVL Trees/046 AVL trees introduction - illustration.mp4 22MB
  8. 06 Balanced Trees_ AVL Trees/055 AVL tree remove implementation I.mp4 22MB
  9. 08 Splay Trees/075 Splay tree implementation I - find_ rotate.mp4 22MB
  10. 04 Stacks & Queues/023 Stack implementation with arrays.mp4 21MB
  11. 06 Balanced Trees_ AVL Trees/045 AVL trees introduction - rotations cases.mp4 21MB
  12. 05 Binary Search Trees/036 Binary search trees implementation II - insertion.mp4 21MB
  13. 05 Binary Search Trees/039 Binary search tree implementation V - remove.mp4 21MB
  14. 03 Linked Lists/010 Linked list theory - operations.mp4 21MB
  15. 10 Binary Heaps/087 Heap introduction - array representation.mp4 20MB
  16. 06 Balanced Trees_ AVL Trees/052 AVL implementation - insertion II.mp4 20MB
  17. 11 Hashtables/098 Hashtables introduction - basics.mp4 20MB
  18. 04 Stacks & Queues/028 Queue implementation with linked list.mp4 19MB
  19. 11 Hashtables/103 Chaining implementation I - put.mp4 19MB
  20. 10 Binary Heaps/096 Heaps in java_util_PriorityQueue.mp4 19MB
  21. 04 Stacks & Queues/025 Dijkstra's interpreter implementation.mp4 19MB
  22. 10 Binary Heaps/086 Heap introduction - basics.mp4 19MB
  23. 06 Balanced Trees_ AVL Trees/044 AVL trees introduction - height.mp4 19MB
  24. 10 Binary Heaps/085 Priority queues introduction.mp4 18MB
  25. 02 Arrays/008 ArraysLists in Java.mp4 18MB
  26. 02 Arrays/007 Using arrays.mp4 18MB
  27. 03 Linked Lists/017 Linked lists in java_util.mp4 18MB
  28. 06 Balanced Trees_ AVL Trees/050 AVL implementation - implementing the rotations.mp4 17MB
  29. 11 Hashtables/105 Chaining implementation III - testing.mp4 17MB
  30. 10 Binary Heaps/092 Heap implementation - insertion.mp4 16MB
  31. 04 Stacks & Queues/019 Stacks in memory management ( stacks_ heaps ).mp4 16MB
  32. 03 Linked Lists/015 Linked list implementation III.mp4 16MB
  33. 03 Linked Lists/009 Linked lists theory - basics.mp4 16MB
  34. 04 Stacks & Queues/020 Stacks and recursive method calls.mp4 16MB
  35. 05 Binary Search Trees/037 Binary search tree implementation III - maximum_ minimum.mp4 15MB
  36. 10 Binary Heaps/093 Heap implementation - get the minimum_maximum.mp4 15MB
  37. 11 Hashtables/099 Hashtables introduction - collisions.mp4 15MB
  38. 09 B-Trees/082 B-tree introduction - insertion.mp4 15MB
  39. 03 Linked Lists/012 Linked list theory - linked lists versus arrays.mp4 14MB
  40. 07 Balanced Trees_ Red-Black Trees/071 Red-black tree implementation VI - fixing the violations.mp4 14MB
  41. 04 Stacks & Queues/021 Stack implementation with linked list I.mp4 14MB
  42. 04 Stacks & Queues/029 Java built in java_util_Queue.mp4 14MB
  43. 11 Hashtables/115 Generic linear probing implementation IV - remove.mp4 14MB
  44. 06 Balanced Trees_ AVL Trees/054 AVL tree remove introduction.mp4 14MB
  45. 11 Hashtables/100 Hashtables introduction - load factor & dynamic resizing.mp4 14MB
  46. 05 Binary Search Trees/035 Binary search trees implementation I - Node_ Tree.mp4 14MB
  47. 08 Splay Trees/076 Splay tree implementation II - spalying.mp4 13MB
  48. 03 Linked Lists/016 Doubly linked list introduction.mp4 13MB
  49. 10 Binary Heaps/091 Other types of heaps_ binomial and Fibonacci heap.mp4 13MB
  50. 11 Hashtables/112 Generic linear probing implementation I - basics.mp4 13MB
  51. 05 Binary Search Trees/041 Custom objects in a tree.mp4 13MB
  52. 05 Binary Search Trees/032 Binary search trees theory - delete.mp4 13MB
  53. 11 Hashtables/116 Generic linear probing implementation V - resize.mp4 13MB
  54. 02 Arrays/005 Arrays introduction - basics.mp4 13MB
  55. 11 Hashtables/119 Maps in Java Collections.mp4 13MB
  56. 07 Balanced Trees_ Red-Black Trees/069 Red-black tree implementation IV - rotate left _ right.mp4 13MB
  57. 02 Arrays/006 Arrays introduction - operations.mp4 12MB
  58. 05 Binary Search Trees/040 Binary search tree implementation VI - remove II.mp4 12MB
  59. 09 B-Trees/080 Disk access times.mp4 12MB
  60. 06 Balanced Trees_ AVL Trees/051 AVL implementation - insertion I.mp4 12MB
  61. 05 Binary Search Trees/038 Binary search tree implementation IV - traversal.mp4 12MB
  62. 10 Binary Heaps/089 Heap introduction - heapsort.mp4 12MB
  63. 09 B-Trees/083 B-tree introduction - deletion.mp4 12MB
  64. 07 Balanced Trees_ Red-Black Trees/059 Red-black trees rotations- cases I.mp4 12MB
  65. 11 Hashtables/108 Linear probing implementation I - put.mp4 11MB
  66. 06 Balanced Trees_ AVL Trees/043 AVL trees introduction - basics.mp4 11MB
  67. 07 Balanced Trees_ Red-Black Trees/058 The logic behind red-black trees.mp4 11MB
  68. 11 Hashtables/114 Generic linear probing implementation III - put.mp4 11MB
  69. 10 Binary Heaps/090 Heap introduction - running times.mp4 11MB
  70. 12 Source Code & Slides/120 JavaAlgoDataStructSlides.zip 11MB
  71. 04 Stacks & Queues/027 Queues introduction.mp4 11MB
  72. 04 Stacks & Queues/026 Java built in java_util_Stack.mp4 11MB
  73. 10 Binary Heaps/088 Heap introduction - remove operation.mp4 11MB
  74. 07 Balanced Trees_ Red-Black Trees/060 Red-black trees rotations- cases II.mp4 10MB
  75. 11 Hashtables/110 Linear probing implementation III - testing.mp4 10MB
  76. 07 Balanced Trees_ Red-Black Trees/063 Red-black trees introduction - example I.mp4 10MB
  77. 11 Hashtables/104 Chaining implementation II - get.mp4 9MB
  78. 05 Binary Search Trees/031 Binary search trees theory - search_ insert.mp4 9MB
  79. 05 Binary Search Trees/033 Binary search trees theory - in-order traversal.mp4 9MB
  80. 09 B-Trees/079 B-tree and external memory.mp4 9MB
  81. 03 Linked Lists/013 Linked list implementation I.mp4 9MB
  82. 06 Balanced Trees_ AVL Trees/049 AVL implementation - balance and height parameters.mp4 9MB
  83. 11 Hashtables/113 Generic linear probing implementation II - get.mp4 9MB
  84. 06 Balanced Trees_ AVL Trees/042 AVL trees introduction - motivation.mp4 9MB
  85. 07 Balanced Trees_ Red-Black Trees/064 Red-black trees introduction - example II.mp4 9MB
  86. 07 Balanced Trees_ Red-Black Trees/066 Red-black tree implementation I - Node class.mp4 9MB
  87. 11 Hashtables/102 Chaining method summary.mp4 9MB
  88. 01 Introduction/003 Data structures and abstract data types.mp4 9MB
  89. 11 Hashtables/107 Linear probing summary.mp4 8MB
  90. 04 Stacks & Queues/018 Stack introduction.mp4 8MB
  91. 01 Introduction/002 Why to use data structures.mp4 8MB
  92. 06 Balanced Trees_ AVL Trees/056 AVL tree generic implementation.mp4 8MB
  93. 09 B-Trees/084 In-order traversal.mp4 8MB
  94. 08 Splay Trees/074 Splay tree introduction II - example.mp4 8MB
  95. 06 Balanced Trees_ AVL Trees/047 AVL trees introduction - sorting.mp4 8MB
  96. 07 Balanced Trees_ Red-Black Trees/061 Red-black trees rotations- cases III.mp4 8MB
  97. 08 Splay Trees/077 Splay tree implementation III - testing.mp4 8MB
  98. 07 Balanced Trees_ Red-Black Trees/068 Red-black tree implementation III - insert.mp4 7MB
  99. 07 Balanced Trees_ Red-Black Trees/065 Red-black tree versus AVL tree.mp4 7MB
  100. 04 Stacks & Queues/022 Stack implementation with linked list II.mp4 7MB
  101. 10 Binary Heaps/094 Heap implementation - heapsort.mp4 7MB
  102. 06 Balanced Trees_ AVL Trees/048 AVL implementation - Node and Tree.mp4 7MB
  103. 11 Hashtables/117 Generic linear probing implementation VI - testing.mp4 7MB
  104. 06 Balanced Trees_ AVL Trees/053 AVL implementation - testing.mp4 6MB
  105. 07 Balanced Trees_ Red-Black Trees/062 Red-black trees rotations- cases IV.mp4 6MB
  106. 11 Hashtables/109 Linear probing implementation II - get.mp4 6MB
  107. 11 Hashtables/097 Associative array ADT.mp4 6MB
  108. 09 B-Trees/081 B-tree introduction - search.mp4 5MB
  109. 05 Binary Search Trees/034 Binary search trees theory - running times.mp4 5MB
  110. 10 Binary Heaps/095 Heap implementation - testing.mp4 4MB
  111. 11 Hashtables/118 Generic linear probing implementation - hashCode.mp4 4MB
  112. 07 Balanced Trees_ Red-Black Trees/067 Red-black tree implementation II - traverse.mp4 4MB
  113. 07 Balanced Trees_ Red-Black Trees/072 Red-black tree implementation VII - testing.mp4 4MB
  114. 03 Linked Lists/011 Linked list theory - doubly linked lists.mp4 4MB
  115. 04 Stacks & Queues/024 Dijkstra's interpreter introduction.mp4 3MB
  116. 01 Introduction/001 Introduction.mp4 3MB
  117. 12 Source Code & Slides/121 sourcecode.zip 88KB
  118. 08 Splay Trees/073 Splay tree introduction I - basics-subtitle-en.vtt 15KB
  119. 09 B-Trees/078 B-tree introduction - basics-subtitle-en.vtt 14KB
  120. 06 Balanced Trees_ AVL Trees/046 AVL trees introduction - illustration-subtitle-en.vtt 13KB
  121. 07 Balanced Trees_ Red-Black Trees/057 Red-black trees introduction - basics-subtitle-en.vtt 13KB
  122. 03 Linked Lists/014 Linked list implementation II-subtitle-en.vtt 12KB
  123. 06 Balanced Trees_ AVL Trees/045 AVL trees introduction - rotations cases-subtitle-en.vtt 12KB
  124. 05 Binary Search Trees/030 Binary search trees theory - basics-subtitle-en.vtt 12KB
  125. 05 Binary Search Trees/036 Binary search trees implementation II - insertion-subtitle-en.vtt 11KB
  126. 04 Stacks & Queues/023 Stack implementation with arrays-subtitle-en.vtt 11KB
  127. 08 Splay Trees/075 Splay tree implementation I - find_ rotate-subtitle-en.vtt 11KB
  128. 10 Binary Heaps/087 Heap introduction - array representation-subtitle-en.vtt 11KB
  129. 03 Linked Lists/010 Linked list theory - operations-subtitle-en.vtt 10KB
  130. 02 Arrays/007 Using arrays-subtitle-en.vtt 10KB
  131. 06 Balanced Trees_ AVL Trees/044 AVL trees introduction - height-subtitle-en.vtt 10KB
  132. 11 Hashtables/098 Hashtables introduction - basics-subtitle-en.vtt 10KB
  133. 05 Binary Search Trees/039 Binary search tree implementation V - remove-subtitle-en.vtt 10KB
  134. 06 Balanced Trees_ AVL Trees/055 AVL tree remove implementation I-subtitle-en.vtt 10KB
  135. 10 Binary Heaps/086 Heap introduction - basics-subtitle-en.vtt 10KB
  136. 02 Arrays/008 ArraysLists in Java-subtitle-en.vtt 10KB
  137. 11 Hashtables/103 Chaining implementation I - put-subtitle-en.vtt 10KB
  138. 07 Balanced Trees_ Red-Black Trees/070 Red-black tree implementation V - fixing the violations-subtitle-en.vtt 10KB
  139. 10 Binary Heaps/085 Priority queues introduction-subtitle-en.vtt 9KB
  140. 04 Stacks & Queues/028 Queue implementation with linked list-subtitle-en.vtt 9KB
  141. 06 Balanced Trees_ AVL Trees/052 AVL implementation - insertion II-subtitle-en.vtt 9KB
  142. 03 Linked Lists/017 Linked lists in java_util-subtitle-en.vtt 9KB
  143. 10 Binary Heaps/096 Heaps in java_util_PriorityQueue-subtitle-en.vtt 9KB
  144. 04 Stacks & Queues/025 Dijkstra's interpreter implementation-subtitle-en.vtt 9KB
  145. 11 Hashtables/105 Chaining implementation III - testing-subtitle-en.vtt 8KB
  146. 04 Stacks & Queues/019 Stacks in memory management ( stacks_ heaps )-subtitle-en.vtt 8KB
  147. 06 Balanced Trees_ AVL Trees/054 AVL tree remove introduction-subtitle-en.vtt 8KB
  148. 11 Hashtables/099 Hashtables introduction - collisions-subtitle-en.vtt 8KB
  149. 03 Linked Lists/009 Linked lists theory - basics-subtitle-en.vtt 8KB
  150. 04 Stacks & Queues/020 Stacks and recursive method calls-subtitle-en.vtt 8KB
  151. 09 B-Trees/082 B-tree introduction - insertion-subtitle-en.vtt 8KB
  152. 05 Binary Search Trees/037 Binary search tree implementation III - maximum_ minimum-subtitle-en.vtt 8KB
  153. 05 Binary Search Trees/035 Binary search trees implementation I - Node_ Tree-subtitle-en.vtt 8KB
  154. 03 Linked Lists/015 Linked list implementation III-subtitle-en.vtt 8KB
  155. 10 Binary Heaps/092 Heap implementation - insertion-subtitle-en.vtt 8KB
  156. 04 Stacks & Queues/021 Stack implementation with linked list I-subtitle-en.vtt 8KB
  157. 06 Balanced Trees_ AVL Trees/050 AVL implementation - implementing the rotations-subtitle-en.vtt 8KB
  158. 03 Linked Lists/012 Linked list theory - linked lists versus arrays-subtitle-en.vtt 8KB
  159. 05 Binary Search Trees/032 Binary search trees theory - delete-subtitle-en.vtt 7KB
  160. 11 Hashtables/112 Generic linear probing implementation I - basics-subtitle-en.vtt 7KB
  161. 03 Linked Lists/016 Doubly linked list introduction-subtitle-en.vtt 7KB
  162. 08 Splay Trees/076 Splay tree implementation II - spalying-subtitle-en.vtt 7KB
  163. 11 Hashtables/115 Generic linear probing implementation IV - remove-subtitle-en.vtt 7KB
  164. 04 Stacks & Queues/029 Java built in java_util_Queue-subtitle-en.vtt 7KB
  165. 11 Hashtables/100 Hashtables introduction - load factor & dynamic resizing-subtitle-en.vtt 7KB
  166. 02 Arrays/006 Arrays introduction - operations-subtitle-en.vtt 7KB
  167. 09 B-Trees/080 Disk access times-subtitle-en.vtt 7KB
  168. 05 Binary Search Trees/041 Custom objects in a tree-subtitle-en.vtt 6KB
  169. 10 Binary Heaps/093 Heap implementation - get the minimum_maximum-subtitle-en.vtt 6KB
  170. 06 Balanced Trees_ AVL Trees/043 AVL trees introduction - basics-subtitle-en.vtt 6KB
  171. 06 Balanced Trees_ AVL Trees/051 AVL implementation - insertion I-subtitle-en.vtt 6KB
  172. 07 Balanced Trees_ Red-Black Trees/071 Red-black tree implementation VI - fixing the violations-subtitle-en.vtt 6KB
  173. 02 Arrays/005 Arrays introduction - basics-subtitle-en.vtt 6KB
  174. 10 Binary Heaps/089 Heap introduction - heapsort-subtitle-en.vtt 6KB
  175. 11 Hashtables/119 Maps in Java Collections-subtitle-en.vtt 6KB
  176. 05 Binary Search Trees/040 Binary search tree implementation VI - remove II-subtitle-en.vtt 6KB
  177. 11 Hashtables/114 Generic linear probing implementation III - put-subtitle-en.vtt 6KB
  178. 11 Hashtables/116 Generic linear probing implementation V - resize-subtitle-en.vtt 6KB
  179. 10 Binary Heaps/090 Heap introduction - running times-subtitle-en.vtt 6KB
  180. 04 Stacks & Queues/027 Queues introduction-subtitle-en.vtt 6KB
  181. 09 B-Trees/083 B-tree introduction - deletion-subtitle-en.vtt 6KB
  182. 05 Binary Search Trees/038 Binary search tree implementation IV - traversal-subtitle-en.vtt 6KB
  183. 07 Balanced Trees_ Red-Black Trees/063 Red-black trees introduction - example I-subtitle-en.vtt 6KB
  184. 11 Hashtables/108 Linear probing implementation I - put-subtitle-en.vtt 6KB
  185. 07 Balanced Trees_ Red-Black Trees/059 Red-black trees rotations- cases I-subtitle-en.vtt 6KB
  186. 04 Stacks & Queues/026 Java built in java_util_Stack-subtitle-en.vtt 6KB
  187. 10 Binary Heaps/088 Heap introduction - remove operation-subtitle-en.vtt 5KB
  188. 07 Balanced Trees_ Red-Black Trees/069 Red-black tree implementation IV - rotate left _ right-subtitle-en.vtt 5KB
  189. 05 Binary Search Trees/031 Binary search trees theory - search_ insert-subtitle-en.vtt 5KB
  190. 03 Linked Lists/013 Linked list implementation I-subtitle-en.vtt 5KB
  191. 11 Hashtables/104 Chaining implementation II - get-subtitle-en.vtt 5KB
  192. 06 Balanced Trees_ AVL Trees/042 AVL trees introduction - motivation-subtitle-en.vtt 5KB
  193. 07 Balanced Trees_ Red-Black Trees/060 Red-black trees rotations- cases II-subtitle-en.vtt 5KB
  194. 06 Balanced Trees_ AVL Trees/049 AVL implementation - balance and height parameters-subtitle-en.vtt 5KB
  195. 07 Balanced Trees_ Red-Black Trees/064 Red-black trees introduction - example II-subtitle-en.vtt 5KB
  196. 11 Hashtables/110 Linear probing implementation III - testing-subtitle-en.vtt 5KB
  197. 11 Hashtables/113 Generic linear probing implementation II - get-subtitle-en.vtt 5KB
  198. 07 Balanced Trees_ Red-Black Trees/058 The logic behind red-black trees-subtitle-en.vtt 5KB
  199. 11 Hashtables/107 Linear probing summary-subtitle-en.vtt 5KB
  200. 09 B-Trees/084 In-order traversal-subtitle-en.vtt 5KB
  201. 05 Binary Search Trees/033 Binary search trees theory - in-order traversal-subtitle-en.vtt 5KB
  202. 11 Hashtables/102 Chaining method summary-subtitle-en.vtt 5KB
  203. 04 Stacks & Queues/018 Stack introduction-subtitle-en.vtt 5KB
  204. 01 Introduction/002 Why to use data structures-subtitle-en.vtt 4KB
  205. 01 Introduction/003 Data structures and abstract data types-subtitle-en.vtt 4KB
  206. 09 B-Trees/079 B-tree and external memory-subtitle-en.vtt 4KB
  207. 08 Splay Trees/074 Splay tree introduction II - example-subtitle-en.vtt 4KB
  208. 06 Balanced Trees_ AVL Trees/056 AVL tree generic implementation-subtitle-en.vtt 4KB
  209. 07 Balanced Trees_ Red-Black Trees/066 Red-black tree implementation I - Node class-subtitle-en.vtt 4KB
  210. 06 Balanced Trees_ AVL Trees/047 AVL trees introduction - sorting-subtitle-en.vtt 4KB
  211. 08 Splay Trees/077 Splay tree implementation III - testing-subtitle-en.vtt 4KB
  212. 07 Balanced Trees_ Red-Black Trees/065 Red-black tree versus AVL tree-subtitle-en.vtt 4KB
  213. 07 Balanced Trees_ Red-Black Trees/061 Red-black trees rotations- cases III-subtitle-en.vtt 4KB
  214. 07 Balanced Trees_ Red-Black Trees/068 Red-black tree implementation III - insert-subtitle-en.vtt 4KB
  215. 04 Stacks & Queues/022 Stack implementation with linked list II-subtitle-en.vtt 4KB
  216. 12 Source Code & Slides/122 FINAL-COUPONS.txt 4KB
  217. 06 Balanced Trees_ AVL Trees/048 AVL implementation - Node and Tree-subtitle-en.vtt 3KB
  218. 10 Binary Heaps/091 Other types of heaps_ binomial and Fibonacci heap-subtitle-en.vtt 3KB
  219. 10 Binary Heaps/094 Heap implementation - heapsort-subtitle-en.vtt 3KB
  220. 11 Hashtables/109 Linear probing implementation II - get-subtitle-en.vtt 3KB
  221. 07 Balanced Trees_ Red-Black Trees/062 Red-black trees rotations- cases IV-subtitle-en.vtt 3KB
  222. 06 Balanced Trees_ AVL Trees/053 AVL implementation - testing-subtitle-en.vtt 3KB
  223. 09 B-Trees/081 B-tree introduction - search-subtitle-en.vtt 3KB
  224. 11 Hashtables/097 Associative array ADT-subtitle-en.vtt 3KB
  225. 05 Binary Search Trees/034 Binary search trees theory - running times-subtitle-en.vtt 3KB
  226. 11 Hashtables/117 Generic linear probing implementation VI - testing-subtitle-en.vtt 2KB
  227. 11 Hashtables/118 Generic linear probing implementation - hashCode-subtitle-en.vtt 2KB
  228. 07 Balanced Trees_ Red-Black Trees/067 Red-black tree implementation II - traverse-subtitle-en.vtt 2KB
  229. 10 Binary Heaps/095 Heap implementation - testing-subtitle-en.vtt 2KB
  230. 07 Balanced Trees_ Red-Black Trees/072 Red-black tree implementation VII - testing-subtitle-en.vtt 2KB
  231. 03 Linked Lists/011 Linked list theory - doubly linked lists-subtitle-en.vtt 2KB
  232. 01 Introduction/001 Introduction-subtitle-en.vtt 1KB
  233. 04 Stacks & Queues/024 Dijkstra's interpreter introduction-subtitle-en.vtt 1KB
  234. 12 Source Code & Slides/122 DISCOUNT FOR OTHER COURSES!.html 1KB
  235. 01 Introduction/004 Complexity theory.html 1KB
  236. 11 Hashtables/111 --------------- Generic Linear Probing -----------------.html 1KB
  237. 11 Hashtables/106 ------------------------------ Linear Probing -------------------------.html 1KB
  238. 11 Hashtables/101 --------------- Chaining -----------------.html 1KB
  239. 12 Source Code & Slides/121 Source code.html 1KB
  240. 12 Source Code & Slides/120 Slides.html 1KB
  241. 01 Introduction/004 free-complexity-theory.zip 264B
  242. [Discuss.FreeTutorials.us].url 252B
  243. [FreeCoursesOnline.Us].url 123B
  244. [FreeTutorials.Us].url 119B
  245. Use VLC Player for Subtitles.url 115B