Lang simplification ( Line Simplification)
Revision as of 10:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ (Derived: The only auxiliary space used is the current search line and the distance from a point in the search interval to the search line, which is all $O(1)$ space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1969 == Reference == -")
Time Complexity
$O(n)$
Space Complexity
$O({1})$
(Derived: The only auxiliary space used is the current search line and the distance from a point in the search interval to the search line, which is all $O(1)$ space)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1969
Reference
-