誊抄书籍

Loading...
Peking University
4.8 (306 ratings) | 21K Students Enrolled
View Syllabus

Reviews

4.8 (306 ratings)
  • 5 stars
    260 ratings
  • 4 stars
    34 ratings
  • 3 stars
    6 ratings
  • 2 stars
    2 ratings
  • 1 star
    4 ratings
ZW

Oct 04, 2018

It's a valuable experience and I learned a lot about algorithms, thanks you !

ZC

Aug 10, 2017

Prestigious University and of course with technical professors.

From the lesson
二分与贪心
二分法是在有序或单调的区间中快速寻找答案的有效方法,当数据量很大适宜采用该方法。所谓贪心算法,即总是作出在当前看来最好的选择。也就是说贪心算法并不从整体最优考虑,它所作出的选择只是在某种意义上的局部最优选择。但是,贪心算法对很多问题都能得到整体最优解。在一些情况下,即使贪心算法不能得到整体最优解,其最终结果却是最优解的很好近似。贪心算法没有固定的算法框架,算法设计的关键是贪心策略的选择。本模块将介绍二分与贪心这两个对很多问题都非常有效的算法策略。

Taught By

  • Jiaying Liu 刘家瑛, Ph.D.

    Jiaying Liu 刘家瑛, Ph.D.

    Associate Professor
  • 郭 炜

    郭 炜

    讲师

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.