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

Loading...
From the course by Стэнфордский университет
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
1497 ratings
Стэнфордский университет
1497 ratings
Course 1 of 4 in the Specialization Algorithms

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science