Correctness Proof II

Loading...
Ver programa

Destrezas que aprenderás

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

Revisiones

4.8 (1,019 calificaciones)
  • 5 stars
    87%
  • 4 stars
    11%
  • 3 stars
    2%
  • 2 stars
    0%
  • 1 star
    0%
SW

Feb 25, 2019

One of the best courses to make a student learn DP in a way that enables him/her to think of the subproblems and way to proceed to solving these subproblems. Definitely helpful for me. Thanks.

NT

Jun 14, 2019

As usual with Stanford and Tim Roughgarden, a high-quality course with an informal style but a lot of rigor. The assignments are challenging but doable. Highly recommended.

De la lección
Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.

Impartido por:

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.