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

Loading...

Compétences que vous apprendrez

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

Avis

4.8 (2,723 notes)
  • 5 stars
    2,305 ratings
  • 4 stars
    355 ratings
  • 3 stars
    40 ratings
  • 2 stars
    10 ratings
  • 1 star
    13 ratings
FR

Mar 16, 2017

Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec

NE

Nov 07, 2016

Personally, I would recommend this course to anyone who really wants to learn how things work in that sort of algorithms. I found the assignments a little difficult, but also extremely helpful.

Enseigné par

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Explorer notre catalogue

Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.