Correctness Proof I

Loading...
Ver programa

Destrezas que aprenderás

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

Revisiones

4.8 (863 calificaciones)
  • 5 stars
    745 ratings
  • 4 stars
    100 ratings
  • 3 stars
    15 ratings
  • 2 stars
    1 ratings
  • 1 star
    2 ratings
JP

Oct 20, 2018

Great learning experience!!!\n\nI love dynamic p the most.\n\nAssignment 4 is so challenging that it takes me a week to finish the program and debug it!!!

SK

Oct 16, 2017

Fantastic course that covered a good variety of content in sufficient details and delves into the fundamentals without sacrificing clarity.

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.