Naive Implementation (k-dimensional space, l m (or l infty) norm Closest Pair Problem)
Jump to navigation
Jump to search
Time Complexity
$O(kn^{2})$
Space Complexity
$O({1})$ words
(can be easily derived)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM
Year
1975
Reference
-