Divide & Conquer
Loading visualizer…
Divide
1
2
3
4
5
6
7
8
Initializing Sorting Algorithms...
Sorting
Trees
Graphs
Preparing interactive visualizations...
Divide & Conquer
Loading visualizer…
Divide
Divide & Conquer
Divide the point set with a vertical line, recurse on each half, then check the δ-wide strip for cross-half pairs that might beat the recursive minimum.
…
Current Best
Not yet foundWhat is the time complexity of the D&C closest pair algorithm?