Register

Algorithms timeComplexity

• retagged by
1,759 views
2 2 votes

It answer is given as A but according to me answer should be C.

Please help 

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← Previous · MY BOOKNext → · Tricky question
← Previous in category · MY BOOKNext in category → · Series
Position:
Show:

Related questions

1 1 vote
3 answers 3 answers
974
974 views
Siramdas Vamshidhar asked Nov 23, 2014
974 views
timecomplexity
for(int i=0; i<n; i++) for(int j=i+1; j<n; j++) for(int k=j+1; k<n; k++)
0 0 votes
1 1 answer
708
708 views
GO Classes asked Sep 16, 2024
708 views
GO Classes Test Series | Data Structures and Algorithms | Topic Wise Test 2 | Question: 5
What is the time complexity of code given?def fun(n): count = 0 i = n while i>0 : for j in range(i): count += 1 i //= 2 return count$\Theta(\log n)$$\Theta(n)$$\Theta(n \...
1 1 vote
2 2 answers
484
484 views
GO Classes asked Sep 16, 2024
484 views
GO Classes Test Series | Data Structures and Algorithms | Topic Wise Test 2 | Question: 6
Consider $\text{Iterated logarithm}$ of $n,$ written $\log^\ast n$ (usually read "$\log$ star $n$"), is the number of times the logarithm (base $2$) function must be iter...