Working with Algorithms in Python
Год выпуска: July 2014
Производитель: O'Reilly Media, Inc.
Сайт производителя:
https://learning.oreilly.com/course/working-with-algorithms/9781491907818/
Автор: George T. Heineman
Продолжительность: 8h 39m
Тип раздаваемого материала: Видеоурок
Язык: Английский + субтитры
Описание:
Learn how to make your Python code more efficient by using algorithms to solve a variety of tasks or computational problems. In this video course, you’ll learn algorithm basics and then tackle a series of problems—such as determining the shortest path through a graph and the minimum edit distance between two genomic sequences—using existing algorithms.
Computer scientist George Heineman fully implements each algorithm from scratch in real time, narrating key concepts and steps along the way, and then demonstrates the execution performance of the algorithm implementations on the model problems.
Algorithms are essential to the way computers process data. The examples you’ll learn in this course are among the most common algorithms in computer science, but they illustrate many of the concerns you’ll face as you work to create algorithms on your own. All code is available on GitHub (
https://github.com/heineman/python- algorithms).
The topics in this video course include:
• Just enough mathematical concepts to understand how to analyze algorithms
• Practical advice to identify code inefficiencies, using algorithm analysis
• A description of fundamental data structures (such as binary trees, heaps, and graphs) and their use in efficient algorithms
• Problem-solving strategies, including Divide and Conquer, Dynamic Programming, Greedy, and Brute Force approaches
• Full implementations of each algorithm in Python within the context of a specific problem
• A description of the most common algorithmic families, including constant-time, logarithmic time, linear time, polynomial time, and exponential time
Содержание
01 BinarySearch
02 O (n log n) Behavior
03 Mathematical Algorithms
04 Brute Force Algorithms
05 K-Dimensional Trees
06 Graph Algorithms
07 AllPairsShortestPath
08 Heap Data Structure
09 Single-Source Shortest Path
10 Summary
Файлы примеров: отсутствуют
Формат видео: MP4
Видео: AVC, 1280×720, 16:9, 30.000 fps, 3 000 kb/s (0.017 bit/pixel)
Аудио: AAC, 44.1 KHz, 2 channels, 128 kb/s, CBR
Доп. информация:
All code is available on
GitHub
