A Greedy Knapsack Heuristic

video-placeholder
Loading...
강의 계획서 보기

배우게 될 기술

Data Structure, Algorithms, Np-Completeness, Dynamic Programming

검토

4.8개(747개 평가)

  • 5 stars
    85.54%
  • 4 stars
    12.85%
  • 3 stars
    1.07%
  • 2 stars
    0.40%
  • 1 star
    0.13%

ML

2019년 11월 12일

Filled StarFilled StarFilled StarFilled StarFilled Star

very interesting course in Algorithms Specialization.\n\nIt is sufficient to arouse interest in studying advance algorithm.\n\nThank you for your teaching, Professor Tim.

JE

2019년 12월 27일

Filled StarFilled StarFilled StarFilled StarFilled Star

I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.

강사:

  • Placeholder

    Tim Roughgarden

    Professor

Coursera 카탈로그 살펴보기

무료로 참여해 맞춤화된 추천, 업데이트 및 제안을 받아보세요.