Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

开始时间: 08/29/2020 持续时间: Unknown

所在平台: Coursera

课程类别: 计算机科学

大学或机构: CourseraNew

   

课程主页: https://www.coursera.org/learn/algorithms-greedy

Explore 1600+ online courses from top universities. Join Coursera today to learn data science, programming, business strategy, and more.

课程评论:没有评论

第一个写评论        关注课程

课程详情

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).

贪婪算法,最小生成树和动态规划:本部分专业知识的主要主题是:贪婪算法(调度,最小生成树,聚类,霍夫曼代码)和动态规划(背包,序列比对,最佳搜索树)。

课程评论(0条)

课程简介

The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum sp

课程标签

贪心算法 动态规划 算法 斯坦福算法

0人关注该课程

主题相关的课程