Naive Implementation (k-dimensional space, l m (or l infty) norm Closest Pair Problem)

From Algorithm Wiki

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

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Naive_Implementation_(k-dimensional_space,_l_m_(or_l_infty)_norm_Closest_Pair_Problem)&oldid=46923"