Algorithms-24-part-Lectu-xUcK
- Introduction\\/01. Algorithms. Introduction.mp444.73MB
- Lecture 1. Union-Find\\/01. Dynamic Connectivity.mp449.65MB
- Lecture 1. Union-Find\\/02. Quick Find.mp449.84MB
- Lecture 1. Union-Find\\/03. Quick Union.mp437.40MB
- Lecture 1. Union-Find\\/04. Quick-union Improvements.mp462.72MB
- Lecture 1. Union-Find\\/05. Union-find Applications.mp444.67MB
- Lecture 10. Geometric Applications of BSTs\\/01. Range Search-1.mp435.56MB
- Lecture 10. Geometric Applications of BSTs\\/02. Line Segment Intersection-2.mp424.42MB
- Lecture 10. Geometric Applications of BSTs\\/03. Kd-trees-3.mp4125.37MB
- Lecture 10. Geometric Applications of BSTs\\/04. Interval Search Trees-4.mp458.38MB
- Lecture 10. Geometric Applications of BSTs\\/05. Rectangle Intersection-5.mp437.31MB
- Lecture 11. Hash Tables\\/01. Hash Functions.mp481.39MB
- Lecture 11. Hash Tables\\/02. Separate Chaining.mp433.17MB
- Lecture 11. Hash Tables\\/03. Linear Probing.mp456.54MB
- Lecture 11. Hash Tables\\/04. Context.mp445.51MB
- Lecture 11. Hash Tables\\/05. Sets.mp423.29MB
- Lecture 11. Hash Tables\\/06. Dictionary Clients.mp427.13MB
- Lecture 11. Hash Tables\\/07. Indexing Clients.mp435.33MB
- Lecture 11. Hash Tables\\/08. Sparse Vectors.mp433.46MB
- Lecture 12. Undirected Graphs\\/01. Introduction To Graphs.mp442.06MB
- Lecture 12. Undirected Graphs\\/02. Graph Api.mp467.14MB
- Lecture 12. Undirected Graphs\\/03. Depth-first Search.mp4112.53MB
- Lecture 12. Undirected Graphs\\/04. Breadth-first Search.mp455.94MB
- Lecture 12. Undirected Graphs\\/05. Connected Components.mp475.58MB
- Lecture 12. Undirected Graphs\\/06. Graph Challenges.mp465.59MB
- Lecture 13. Directed Graphs\\/01. Introduction To Digraphs.mp436.75MB
- Lecture 13. Directed Graphs\\/02. Digraph Api.mp421.01MB
- Lecture 13. Directed Graphs\\/03. Digraph Search.mp489.87MB
- Lecture 13. Directed Graphs\\/04. ological Sort.mp449.81MB
- Lecture 13. Directed Graphs\\/05. Strong Components.mp484.18MB
- Lecture 14. Minimum Spanning Trees\\/01. Introduction To Msts.mp418.46MB
- Lecture 14. Minimum Spanning Trees\\/02. Greedy Algorithm.mp453.98MB
- Lecture 14. Minimum Spanning Trees\\/03. Edge-weighted Graph Api.mp448.36MB
- Lecture 14. Minimum Spanning Trees\\/04. Kruskals Algorithm.mp453.27MB
- Lecture 14. Minimum Spanning Trees\\/05. Prims Algorithm.mp4145.82MB
- Lecture 14. Minimum Spanning Trees\\/06. Mst Context.mp446.25MB
- Lecture 15. Shortest Paths\\/01. Shortest Paths Apis.mp446.93MB
- Lecture 15. Shortest Paths\\/02. Shortest Path Properties.mp466.75MB
- Lecture 15. Shortest Paths\\/03. Dijkstras Algorithm.mp483.96MB
- Lecture 15. Shortest Paths\\/04. Edge-weighted Dags.mp484.79MB
- Lecture 15. Shortest Paths\\/05. Negative Weights.mp487.92MB
- Lecture 16. ximum Flow and Minimum Cut\\/01. Introduction To Maxflow.mp445.04MB
- Lecture 16. ximum Flow and Minimum Cut\\/02. Ford-fulkerson Algorithm.mp426.12MB
- Lecture 16. ximum Flow and Minimum Cut\\/03. Maxflow-mincut Theorem.mp442.29MB
- Lecture 16. ximum Flow and Minimum Cut\\/04. Running Time Analysis.mp440.21MB
- Lecture 16. ximum Flow and Minimum Cut\\/05. Ja Implementation.mp465.80MB
- Lecture 16. ximum Flow and Minimum Cut\\/06. Maxflow Applications.mp4102.33MB
- Lecture 17. Radix Sorts\\/01. Strings In Ja.mp477.58MB
- Lecture 17. Radix Sorts\\/02. Key-indexed Counting.mp454.74MB
- Lecture 17. Radix Sorts\\/03. Lsd Radix Sort.mp470.25MB
- Lecture 17. Radix Sorts\\/04. Msd Radix Sort.mp463.27MB
- Lecture 17. Radix Sorts\\/05. 3-way Radix Quicksort.mp433.12MB
- Lecture 17. Radix Sorts\\/06. Suffix Arrays.mp487.73MB
- Lecture 18. Tries\\/01. R-way Tries.mp4127.15MB
- Lecture 18. Tries\\/02. Ternary Search Tries.mp484.26MB
- Lecture 18. Tries\\/03. Character-ba<x>sed Operations.mp493.29MB
- Lecture 19. Substring Search\\/01. Introduction To Substring Search.mp428.46MB
- Lecture 19. Substring Search\\/02. Brute-force Substring Search.mp443.27MB
- Lecture 19. Substring Search\\/03. Knuth-morris-pratt.mp4136.43MB
- Lecture 19. Substring Search\\/04. Boyer-moore.mp433.85MB
- Lecture 19. Substring Search\\/05. Rabin-karp.mp474.95MB
- Lecture 2. Analysis of Algorithms\\/01 Introduction To Analysis Of Algorithms.mp439.25MB
- Lecture 2. Analysis of Algorithms\\/02. Observations.mp443.27MB
- Lecture 2. Analysis of Algorithms\\/03. thematical Models.mp458.81MB
- Lecture 2. Analysis of Algorithms\\/04. Order-of-growth Classifications.mp466.92MB
- Lecture 2. Analysis of Algorithms\\/05. Theory Of Algorithms.mp452.72MB
- Lecture 2. Analysis of Algorithms\\/06. Memory.mp438.43MB
- Lecture 20. Regular ex<x>pressions\\/01. Regular ex<x>pressions.mp491.27MB
- Lecture 20. Regular ex<x>pressions\\/02. Res And Nfas.mp460.67MB
- Lecture 20. Regular ex<x>pressions\\/03. Nfa Simulation.mp476.16MB
- Lecture 20. Regular ex<x>pressions\\/04. Nfa Construction.mp445.68MB
- Lecture 20. Regular ex<x>pressions\\/05. Regular ex<x>pression Applications.mp493.81MB
- Lecture 21. Data Compression\\/01. Introduction To Data Compression.mp4103.82MB
- Lecture 21. Data Compression\\/02. Run-length Coding.mp427.48MB
- Lecture 21. Data Compression\\/03. Huffn Compression.mp4101.09MB
- Lecture 21. Data Compression\\/04. Lzw Compression.mp4105.15MB
- Lecture 22. Reductions\\/01. Introduction To Reductions.mp443.00MB
- Lecture 22. Reductions\\/02. Designing Algorithms.mp435.96MB
- Lecture 22. Reductions\\/03. Establishing Lower Bounds.mp443.75MB
- Lecture 22. Reductions\\/04. Classifying Problems.mp456.19MB
- Lecture 23. Linear Programming\\/01. Brewer\s Problem.mp492.58MB
- Lecture 23. Linear Programming\\/02. Simplex Algorithm.mp453.46MB
- Lecture 23. Linear Programming\\/03. Simplex Implementations.mp475.52MB
- Lecture 23. Linear Programming\\/04. Linear Programming Reductions.mp456.07MB
- Lecture 24. Intractability\\/01. Introduction To Intractability.mp481.96MB
- Lecture 24. Intractability\\/02. Search Problems.mp452.11MB
- Lecture 24. Intractability\\/03. P Vs Np.mp477.23MB
- Lecture 24. Intractability\\/04. Classifying Problems.mp462.87MB
- Lecture 24. Intractability\\/05. Np-completeness.mp458.50MB
- Lecture 24. Intractability\\/06. Coping With Intractability.mp462.80MB
- Lecture 3. Stacks and Queues\\/01. Stacks.mp479.02MB
- Lecture 3. Stacks and Queues\\/02. Resizing Arrays.mp447.52MB
- Lecture 3. Stacks and Queues\\/03. Queues.mp421.69MB
- Lecture 3. Stacks and Queues\\/04. Generics.mp445.17MB
- Lecture 3. Stacks and Queues\\/05. Iterators.mp434.75MB
- Lecture 3. Stacks and Queues\\/06. Stack And Queue Applications.mp464.24MB
- Lecture 4. Elementary Sorts\\/01. Introduction To Sorting.mp467.69MB
- Lecture 4. Elementary Sorts\\/02. Selection Sort.mp430.87MB
- Lecture 4. Elementary Sorts\\/03. Insertion Sort.mp441.32MB
- Lecture 4. Elementary Sorts\\/04. Shellsort.mp443.88MB
- Lecture 4. Elementary Sorts\\/05. Shuffling.mp430.83MB
- Lecture 4. Elementary Sorts\\/06. Convex Hull.mp462.39MB
- Lecture 5. Mergesort\\/01. Mergesort.mp4104.35MB
- Lecture 5. Mergesort\\/02. Bottom-up Mergesort.mp414.54MB
- Lecture 5. Mergesort\\/03. Sorting Complexity.mp438.93MB
- Lecture 5. Mergesort\\/04. Comparators.mp431.42MB
- Lecture 5. Mergesort\\/05. Stability.mp424.71MB
- Lecture 6. Quicksort\\/01. Quicksort.mp484.75MB
- Lecture 6. Quicksort\\/02. Selection.mp433.08MB
- Lecture 6. Quicksort\\/03. Duplicate Keys.mp449.47MB
- Lecture 6. Quicksort\\/04. System Sorts.mp454.67MB
- Lecture 7. Priority Queues\\/01. Apis And Elementary Implementations.mp457.18MB
- Lecture 7. Priority Queues\\/02. Binary Heaps.mp4107.21MB
- Lecture 7. Priority Queues\\/03. Heapsort.mp457.71MB
- Lecture 7. Priority Queues\\/04. Event-driven Simulation.mp4106.73MB
- Lecture 8. Elementary Symbol Tables\\/01. Symbol Table Apis.mp4100.74MB
- Lecture 8. Elementary Symbol Tables\\/02. Elementary Implementations.mp442.06MB
- Lecture 8. Elementary Symbol Tables\\/03. Ordered Operations.mp428.82MB
- Lecture 8. Elementary Symbol Tables\\/04. Binary Search Trees.mp482.84MB
- Lecture 8. Elementary Symbol Tables\\/05. Ordered Operations In Bsts.mp445.62MB
- Lecture 8. Elementary Symbol Tables\\/06. Deletion In Bsts.mp445.51MB
- Lecture 9. Balanced Search Trees\\/01. Search Trees-1.mp469.43MB
- Lecture 9. Balanced Search Trees\\/02. Red-black Bsts-2.mp4156.54MB
- Lecture 9. Balanced Search Trees\\/03. B-trees-3.mp448.79MB
- Algorithms_9780134384436_FullOutline_Readings_08-2015.pdf212.41KB
- CreateTime2020-01-25
- UpdateTime2020-01-26
- FileTotalCount125
- TotalSize14.62GBHotTimes5ViewTimes10DMCA Report EmailmagnetLinkThunderTorrent DownBaiduYunLatest Search: 1.WIL-014 2.SOE-506 3.AAJB-008 4.PBD-064 5.SIKO-01 6.RKI-244 7.MBYD-137 8.PSI-117 9.YTR-040 10.MDS-744 11.GUR-002 12.PPBD-045 13.DMBE-001 14.ATFB-043 15.QXL-91 16.MIBD-661 17.TIA-201 18.BROZ-090 19.FTA-154 20.ERDV-210 21.MAGD-12 22.MIBD-738 23.AD-266 24.SCD-003 25.IDBD-202 26.NFDM-096 27.SOE-060 28.ONSD-623 29.MIBD-729 30.ONSD-407 31.ATID-208 32.MDED-439 33.DJNO-28 34.DKBC-05 35.II-106 36.REAL-317 37.MIBD-457 38.DVH-371 39.BYD-109 40.ONSD-579 41.CADV-251 42.AUKG-145 43.SHA-011 44.SSPD-062 45.DDB-067 46.DQ-007 47.DV-1213 48.OPBD-056 49.TT-052 50.ABS-105 51.JUSD-459 52.TCD-117 53.TOD-183 54.REBDB-043 55.JRZD-364 56.BOIN-006 57.SAKD-198 58.GACI-004 59.SWD-054 60.DJSI-037 61.ALX-229 62.DIGI-068 63.VERT-001 64.CJD-040 65.SEED-077 66.DPS-008 67.KA-1341 68.SCP-092 69.LABS-028 70.DAMO-036 71.014 72.506 73.008 74.0 75.01 76.244 77.137 78.117 79.040 80.744 81.002 82.045 83.001 84.043 85.91 86.661 87.201 88.090 89.154 90.210 91.12 92.738 93.266 94.003 95.202 96.096 97.060 98.623 99.729 100.407 101.208 102.439 103.28 104.05 105.106 106.317 107.457 108.371 109.109 110.579 111.251 112.145 113.011 114.062 115.067 116.007 117.1213 118.056 119.052 120.105 121.459 122.117 123.183 124.043 125.3 126.006 127.198 128.004 129.054 130.037 131.229 132.068 133.001 134.040 135.077 136.008 137.1341 138.092 139.028 140.036