<https://de.coursera.org/learn/algorithms-greedy#mooc>
<http://schema.org/description>
"The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees)."
<https://de.coursera.org/learn/algorithms-greedy>