Working with Algorithms in Python

1. 01_efficient-searching-using-binaryarraysearch-and-binary-search-trees-part-1.mp4248.51MB
2. 02_efficient-searching-using-binaryarraysearch-and-binary-search-trees-part-2.mp4269.28MB
3. 03_creating-a-balanced-binary-search-tree-from-a-sorted-list.mp457.05MB
4. 04_an-informal-introduction-to-the-analysis-of-algorithms.mp4359.34MB
5. 05_mergesort-a-divide-and-conquer-algorithm.mp4406.21MB
6. 06_using-mergesort-to-sort-external-data.mp4100.13MB
7. 09_mathematical-algorithms-exponentiation-by-squaring.mp4334.76MB
8. 10_using-exponentiation-by-squaring-to-determine-whether-an-integer-is-prime.mp475.85MB
9. 11_brute-force-an-algorithm-for-solving-combinatoric-problems.mp4411.79MB
10. 12_using-brute-force-to-generate-magic-squares.mp4150.3MB
11. 13_kd-trees-efficient-processing-of-two-dimensional-datasets-part-1.mp4346.47MB
12. 14_kd-trees-efficient-processing-of-two-dimensional-datasets-part-2.mp4122.32MB
13. 15_using-kd-trees-to-compute-nearest-neighbor-queries.mp4126.56MB
14. 16_graph-algorithms-depth-first-search-part-1.mp4244.79MB
15. 17_graph-algorithms-depth-first-search-part-2.mp4167.33MB
16. 18_using-depth-first-search-to-construct-a-rectangular-maze.mp4106.77MB
17. 19_graph-algorithms-all-pairs-shortest-path.mp4364.04MB
18. 20_using-dynamic-programming-to-compute-minimum-edit-distance.mp472.28MB
19. 21_the-heap-data-structure-and-its-use-in-heapsort.mp4203.96MB
20. 22_using-heapsort-to-sort-a-collection.mp469.48MB
21. 23_single-source-shortest-path-using-priority-queues.mp4317.5MB
22. 24_using-priority-queues-to-compute-the-minimum-spanning-tree.mp464.17MB
23. 25_course-summary.mp417.49MB