Working with Algorithms in Python

1. 04. Brute Force Algorithms/01. Brute Force An Algorithm for Solving Combinatoric Problems.mp4 411.79 MB
2. 02. O (n log n) Behavior/01. MergeSort A Divide and Conquer Algorithm.mp4 406.21 MB
3. 07. AllPairsShortestPath/01. Graph Algorithms All Pairs Shortest Path.mp4 364.04 MB
4. 01. BinarySearch/04. An Informal Introduction to the Analysis of Algorithms.mp4 359.34 MB
5. 05. K-Dimensional Trees/01. KD Trees Efficient Processing of Two-Dimensional Datasets Part 1.mp4 346.47 MB
6. 03. Mathematical Algorithms/01. Mathematical Algorithms Exponentiation By Squaring.mp4 334.76 MB
7. 09. Single-Source Shortest Path/01. Single-Source Shortest Path Using Priority Queues.mp4 317.50 MB
8. 01. BinarySearch/02. Efficient Searching using BinaryArraySearch and Binary Search Trees Part 2.mp4 269.28 MB
9. 01. BinarySearch/01. Efficient Searching using BinaryArraySearch and Binary Search Trees Part 1.mp4 248.51 MB
10. 06. Graph Algorithms/01. Graph Algorithms Depth First Search Part 1.mp4 244.79 MB
11. 08. Heap Data Structure/01. The Heap Data Structure and Its Use in HeapSort.mp4 203.96 MB
12. 06. Graph Algorithms/02. Graph Algorithms Depth First Search Part 2.mp4 167.33 MB
13. 04. Brute Force Algorithms/02. Using Brute Force to Generate Magic Squares.mp4 150.30 MB
14. 05. K-Dimensional Trees/03. Using KD Trees to Compute Nearest Neighbor Queries.mp4 126.56 MB
15. 05. K-Dimensional Trees/02. KD Trees Efficient Processing of Two-Dimensional Datasets Part 2.mp4 122.32 MB
16. 06. Graph Algorithms/03. Using Depth First Search to Construct a Rectangular Maze.mp4 106.77 MB
17. 02. O (n log n) Behavior/02. Using MergeSort to Sort External Data.mp4 100.13 MB
18. 03. Mathematical Algorithms/02. Using Exponentiation by Squaring to Determine Whether an Integer Is Prime.mp4 75.85 MB
19. 07. AllPairsShortestPath/02. Using Dynamic Programming to Compute Minimum Edit Distance.mp4 72.28 MB
20. 08. Heap Data Structure/02. Using HeapSort to Sort a Collection.mp4 69.48 MB
21. 09. Single-Source Shortest Path/02. Using Priority Queues to Compute the Minimum Spanning Tree.mp4 64.18 MB
22. 01. BinarySearch/03. Creating a Balanced Binary Search Tree from a Sorted List.mp4 57.05 MB
23. 10. Summary/01. Course Summary.mp4 17.49 MB