Lang simplification ( Line Simplification): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(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 == -")
 
No edit summary
 
Line 23: Line 23:
== Model of Computation ==  
== Model of Computation ==  


 
Real RAM


== Year ==  
== Year ==  

Latest revision as of 07:54, 10 April 2023

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

Real RAM

Year

1969

Reference

-