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

From the course by 斯坦福大学
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
1568 ratings
1568 ratings
Course 1 of 4 in the Specialization Algorithms

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Computer Science

Explore our Catalog

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