212 views

2 Answers

0 votes
0 votes
Time complexity=O(square(log(n)))
0 votes
0 votes
First it evalutes inside while loop upto logn to the base2 times and then the first while apply on 2nd while loop and the final result produces O(logn.logn) which means O(square(logn))

Related questions

0 votes
0 votes
0 answers
1
aaru14 asked Nov 27, 2017
279 views
https://gateoverflow.in/?qa=blob&qa_blobid=15895383759487537860find complexity ??where n is prime.someone plz explain??
2 votes
2 votes
2 answers
4
aaru14 asked Sep 13, 2017
1,433 views
if the subnet mask is 255.255.255.224which of the following can be DBA of subnet.a)201.55.66.15b)201.55.66.31c)201.55.66.63d)all