Register

Recent questions tagged time-complexity

3 votes
1 answer
121
Google
$Find \ Time \ Complexity :$ $T(n) =$ $n^{\frac{1}{3}}$ . T($n^{\frac{2}{3}}$) + $\Theta (n)$
$Find \ Time \ Complexity :$ $T(n) =$ $n^{\frac{1}{3}}$ . T($n^{\frac{2}{3}}$) + $\Theta (n)$
User Avatar
0 votes
0 answers
122
Ace academy test series
Time Complexity in C will be O(n) right? and big omega (n) is also big omega (n^2), then why is c incorrect?
Time Complexity in C will be O(n) right? and big omega (n) is also big omega (n^2), then why is c incorrect?
User Avatar
0 votes
0 answers
123
I have a algorithm and i want to prove with induction, need help!
Hello, i have a algorithm and i want to prove it with induction how can i do that ? Also i want to worst case run time analyze but i am not very good please help me please. Thank you so much!
Hello, i have a algorithm and i want to prove it with induction how can i do that ?Also i want to worst case run time analyze but i am not very good please help me please...
User Avatar
0 votes
1 answer
125
Madeeasy Algorithm
How to solve this recurrence relation T(n)= T(0.09n) + T(0.91n) + cn where c is constant and T(1)=1 options are-
How to solve this recurrence relationT(n)= T(0.09n) + T(0.91n) + cnwhere c is constant and T(1)=1options are-
User Avatar
0 votes
1 answer
127
Algorithms
how O($n^{2}$) in the last.(in the given solution).
how O($n^{2}$) in the last.(in the given solution).
User Avatar
1 votes
0 answers
128
AVL Trees
Given a skew tree what will be the time complexity to balance the tree? What will be the algorithm for this?
Given a skew tree what will be the time complexity to balance the tree? What will be the algorithm for this?
User Avatar
0 votes
0 answers
129
Algorithms
Is it really coping operation will take O(n). Does copy is done character by character. means simple code like (in c++) for(int i=0;i<n;i++) { s=s; } will take O($n^{2}$)
Is it really coping operation will take O(n).Does copy is done character by character.means simple code like (in c++) for(int i=0;i<n;i++){s=s;}will take O($n^{2}$)
User Avatar
0 votes
0 answers
130
Computer Networks
I am not getting the question.(Please explain me the question first).
I am not getting the question.(Please explain me the question first).
User Avatar
3 votes
3 answers
132
unacademy combat
what will be time complexity of this program? void function(int n) { int count = 0; for (int i=0; i<n; i++) { for (int j=1; j< i*i; j++) { if (j%i == 0) { for (int k=0; k<j; k++) printf("*"); } } } }
what will be time complexity of this program?void function(int n){ int count = 0; for (int i=0; i<n; i++) { for (int j=1; j< i*i; j++) { ...
User Avatar
0 votes
3 answers
133
Self doubt.
What is the time & space complexity of this algorithm? Main() { for(i=n; i>10; i=i^1/4) { for(j=201; j<n^3; j=j+400) { for(k=47; k<=n^84; k=k*108) { k=k^61; } } } }
What is the time & space complexity of this algorithm?Main(){ for(i=n; i>10; i=i^1/4) { for(j=201; j<n^3; j=j+400) ...
User Avatar
0 votes
1 answer
137
Algorithms
Given ‘N’ objects, which are coloured as red, white and blue. Sort these objects so that objects of the same colour are adjacent, with the colours in the order red, white and blue. Design an algorithm with a time com- plexity of O(nlog n)
Given ‘N’ objects, which are coloured as red, white and blue. Sort theseobjects so that objects of the same colour are adjacent, with the coloursin the order red, whi...
User Avatar
Page: