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

Loading...
From the course by Stanford University
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
1834 ratings
Stanford University
1834 ratings
Course 1 of 4 in the Specialization Algorithms

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.