Brute Force (2-dimensional Convex Hull)

From Algorithm Wiki

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"