Graham (2-dimensional Convex Hull)
Revision as of 10:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$ words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1972 == Reference == https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0020019072900452?via%3Dihub")
Time Complexity
$O(nlogn)$
Space Complexity
$O(n)$ words
(can be easily derived)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM
Year
1972