Consider functions Function 1 and Function 2 expressed in pseudocode as follows:
Function 1 Function 2 while n > 1 do for i = 1 to 100 ∗ n do for i=1 to n do x=x+1 x = x + 1; end for end for n = [n/2]; end while
Let f1(n) and f2(n) denote the number of times the statement “x = x + 1” is executed in Function 1 and Function 2, respectively.
Which of the following statements is/are TRUE?
(A)
f1(n) ∈ Θ(f2(n))
(B)
f1(n) ∈ o(f2(n))
(C)
f1(n) ∈ ω(f2(n))
(D)
f1(n) ∈ O(n)
Answer
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!