Register

time complexity

• edited by
425 views
0 0 votes
i=n;
while(i>0)
{
j=1;
while(j<=n)
{
j=2*j;

}

i=i/2;
}
then what is the time complexity?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · #ME Test seriesNext → · Permutation with sta...
← Previous in category · Made easy test serie...Next in category → · time complexity
Position:
Show:

Related questions

3 3 votes
1 1 answer
226
226 views
GO Classes asked Aug 31
226 views
GO Classes DPP | GATE CS, DA | Algorithms | Time Complexity
The algorithm $\text{ALGSORT}$ sorts an array of distinct integers using comparisons.The function $\text{MININDEX(V,i,j)}$ returns the position of the smallest element in...
1 1 vote
1 1 answer
158
158 views
GO Classes asked Aug 29
158 views
GO Classes DPP | GATE CS, DA | Algorithms | Time Complexity
Suppose Huffman coding is implemented as follows.Initially, the $n$ symbols are stored in a min priority queue according to their frequencies.The algorithm repeatedly per...
1 1 vote
1 1 answer
136
136 views
GO Classes asked Aug 26
136 views
GO Classes DPP | GATE CS, DA | Algorithms | Time Complexity
Consider,f1(N): x = 0 for i = 0 to N - 1: x++ return xand,f2(N, R): x = 0 for i = 0 to N - 1: for j = 1; j <= R; j = j + j: x = x + f1(j) return xWhat is the order of gro...
0 0 votes
0 0 answers
315
315 views
Vennapusa_Gurunath_r asked Dec 12, 2024
315 views
Time Complexity Analysis
Please give me suggestion I am Good at conceptual in algorithms but i am issue facing at Find time complexity of any problem.What Can i do resolve this problem .I revised...