• edited by
442 views

1 Answer

Best answer
1 1 vote
The definition of $\Theta$ goes like this: $f(n) = \Theta(g(n)) \implies c_1g(n)\le f(n) \le c_2g(n) \,(\exists n_0 \forall n\gt n_0 ,c_1,c_2\gt0)$.

Here, $\frac{1}{4} \le 1$ and $\frac{1}{4} \ge \frac{1}{5}*1$. Hence the $\Theta$ definition fits.
• selected by
Position:
Show:

Related questions

0 0 votes
0 0 answers
527
527 views
usdid asked Apr 16, 2022
527 views
a) what is the iterative equation showing the running time of the algorithm whose pseudocode is given below? b) What is this repeated equation in asymptotic notation usin...
0 0 votes
0 0 answers
843
843 views
kira000 asked Jan 17, 2023
843 views
Let $f(n)$ be a positive increasing function. Consider the below two statements:S1: if an algorithm is $\Theta(f(n))$ in the average case, then it is $\Omega(f(n))$ in th...