Given is a strictly increasing function, f(x). Strictly increasing meaning: f(x)< f(x+1).="" (refer="" to="" the="" example="" graph="" of="" functions="" for="" a="">
Now, define an algorithm that finds the
smallest positive integer, n, at which the function,
f(n), becomes positive.
The things left to do is to:
Describe the algorithm you came up with and make it O(log n).
Extracted text: Strictly Increasing function Strictly increasing y f(x) f(x) As x moves right, y gets bigger
Extracted text: 2. Strictly Increasing Given a function, f(x), which is a strictly increasing function, define an algorithm that finds the smallest positive integer, n, for which the function, f(n) becomes positive. The challenge here is to solve this by defining an algorithm that runs on O(log n) time complexity.