El objetivo está desatendido
El autor lleva sin comentar el objetivo 8 años 11 meses 3 días
General
Прослушать курс лекций Algorithm Design and Analysis
https://itunes.apple.com/md/itunes-u/algorithm-des...
Все в ту же копилку знаний по Алгоритмам
Criterio del fin
Прослушать все лекции
-
Introduction to the videos
-
Introduction to the course and algorithm complexity
-
Big-Oh, Omega and Theta notation
-
Time analysis of Mergesort
-
A more complex recurrence relation and counting inversions
-
Counting inversions; Fast integer multiplication
-
Fast integer multiplication, randomized selection and median finding
-
More on randomized selection and median finding
-
Expected number of comparisons in randomized select
-
Greedy algorithms: Picking largest set of non-overlapping intervals
-
Greedy algorithms: The classroom scheduling problem
-
Dijkstra's shortest path algorithm
-
Start of minimum spanning tree problem
-
Correctness of Kruskal's algorithm.
-
Recursive programming and memoization
-
Intro to dynamic programming, weighted interval problems
-
Intro to the RNA folding problem and recurrences
-
Dynamic programming for RNA folding.
-
Dynamic programming for shortest path problem
-
Floyd-Warshall algorithm for all-pairs shortest path
-
The unique-decipherability problem
-
Unique-Decipherability. Graph algorithm and proof of correctness
-
Linear-time pattern matching. Z-values and Z-algorithm
-
Finish of linear-time pattern matching
-
Introduction to approximation algorithms
-
Introduction to P and NP
-
An intuitive view of NP
-
Formal definition of P and NP
-
Major theorems of NP-completeness
-
Coping with NP-completeness
¡No omita entradas nuevas!
Suscríbase al objetivo y siga su logro
