O(n log n) Algorithm for Closest Pair I [Advanced - Optional]

Loading...
Ver programa

Destrezas que aprenderás

Algorithms, Randomized Algorithm, Sorting Algorithm, Divide And Conquer Algorithms

Revisiones

4.8 (4,057 calificaciones)
  • 5 stars
    83.80%
  • 4 stars
    13.53%
  • 3 stars
    1.62%
  • 2 stars
    0.36%
  • 1 star
    0.66%
CV

Jun 11, 2017

A really exciting and challenging course. Loved the way the instructor explained everything with so much detail and precision. Definitely looking forward to the next course in the specialization.

VP

Apr 27, 2020

Professor Tim is an amazing instructor, and he explained all those elegant proofs in a brief and concise manner. I really enjoyed this course and certainly felt my IQ level going above roof ! :P

Impartido por:

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Explora nuestro catálogo

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