Give the “best” big-oh notation to describe the complexity of the algorithm that prints all bit strings of length n.
1 answer:
You might be interested in
We have that
f(x) = (x – 5)³(x + 2)²
we know that
<span>the roots can touch or cross the x axis
</span>The way you can tell if the graph is going to cross the x-axis or just touch the x-axis is by looking at the power of the factor.
(x - 5)³ has a power of 3 which is an ODD number. An ODD power means that the graph will cross through the x-axis.
(x + 2)² has a power of 2 which is an EVEN number. An EVEN power means that the graph will touch the x-axis.
therefore
the answer is
<span>the graph of f(x) touch the x axis for the root x=-2
</span>
see the attached figure
f(x) = (x – 5)³(x + 2)²
we know that
<span>the roots can touch or cross the x axis
</span>The way you can tell if the graph is going to cross the x-axis or just touch the x-axis is by looking at the power of the factor.
(x - 5)³ has a power of 3 which is an ODD number. An ODD power means that the graph will cross through the x-axis.
(x + 2)² has a power of 2 which is an EVEN number. An EVEN power means that the graph will touch the x-axis.
therefore
the answer is
<span>the graph of f(x) touch the x axis for the root x=-2
</span>
see the attached figure
