Hinrichs; Nievergelt; Schorn (2-dimensional space, l m (or l infty) norm Closest Pair Problem): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O(n logn)$ == Space Complexity == $O(n)$ words (https://www.sciencedirect.com/science/article/pii/0020019088901500) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1988 == Reference == https://www.sciencedirect.com/science/article/pii/0020019088901500")
 
No edit summary
 
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


$O(n logn)$
$O(n \log n)$


== Space Complexity ==  
== Space Complexity ==  

Latest revision as of 08:55, 10 April 2023

Time Complexity

$O(n \log n)$

Space Complexity

$O(n)$ words

(https://www.sciencedirect.com/science/article/pii/0020019088901500)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1988

Reference

https://www.sciencedirect.com/science/article/pii/0020019088901500

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Hinrichs;_Nievergelt;_Schorn_(2-dimensional_space,_l_m_(or_l_infty)_norm_Closest_Pair_Problem)&oldid=46965"