Brute Force (2-dimensional Convex Hull)

From Algorithm Wiki
Revision as of 11:32, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n)$ words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1935 == Reference == -")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

$O(n)$ words

(can be easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1935

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Brute_Force_(2-dimensional_Convex_Hull)&oldid=44415"