Register

Recent questions tagged time-complexity

0 votes
0 answers
661
Algo: Time Complexity
What is the time complexity of the following piece of code in the terms of n? $Main()$ { $n=2^{2^k};$ $for(i=1; i<=n; i++)$ { $j=2;$ $while(j<=n)$ { $j=j^2;$ } } }
What is the time complexity of the following piece of code in the terms of n?$Main()${$n=2^{2^k};$$for(i=1; i<=n; i++)${ $j=2;$ $while(j<=n)$ { $j=j^2;$ }}...
User Avatar
0 votes
3 answers
663
Time Complexity
What is the time complexity of the following code? for(i=n;i>=1;) i=i/2;
What is the time complexity of the following code?for(i=n;i>=1;)i=i/2;
User Avatar
0 votes
3 answers
665
Self-Doubt
int main() { int i; for(i=1;i<=n;i++) f(i); } void f(int n) { int A[n]; int j; for(j=1;j<=n;j++) cout<<j; } What will be the time and space complexity of the following code snippet ?
int main() { int i; for(i=1;i<=n;i++) f(i); } void f(int n) { int A[n]; int j; for(j=1;j<=n;j++) cout<<j; }What will be the time and space complexity of the following cod...
User Avatar
1 votes
2 answers
666
Cormen
T(n)=T(n-1)+2n where T(1)=1 Solve recurrence relation
T(n)=T(n-1)+2n where T(1)=1Solve recurrence relation
User Avatar
0 votes
0 answers
667
Complexity
#DAA Prove that if: f(n) = amnm + am-1nm-1 + am-2nm-2 + am-3nm-3 + .........+ a1n + a0 then f(n) = O(nm) .
#DAAProve that if: f(n) = amnm + am-1nm-1 + am-2nm-2 + am-3nm-3 + .........+ a1n + a0 then f(n) = O(nm) .
User Avatar
1 votes
1 answer
669
Sorting
Which sorting algorithm is good if we already knew the range of number - Counting Sort OR Radix Sort
Which sorting algorithm is good if we already knew the range of number -Counting Sort OR Radix Sort
User Avatar
1 votes
2 answers
670
Made easy test series
User Avatar
7 votes
3 answers
671
Time complexity , Recursion
Why is recursive equation of following code $T(n)=T(n/2)+O(1)$, not $T(n)=8*T(n/2)+O(1)$? int x=0; int A(n) { if(n==1) return 1; else { X+=8A(n/2)+n^3; } return X; }
Why is recursive equation of following code $T(n)=T(n/2)+O(1)$, not $T(n)=8*T(n/2)+O(1)$? int x=0; int A(n) { if(n==1) return 1; else { X+=8A(n/2)+n^3; } return X; }
User Avatar
0 votes
1 answer
674
Time complexity
Which of the following sorting algorithm has almost the same worst case and best case complexity? 1- Quick Sort 2- Merge Sort 3- Shell Sort 4- Heap Sort PS: Is it heap or shell, I am confused. Please clarify me.
Which of the following sorting algorithm has almost the same worst case and best case complexity?1- Quick Sort2- Merge Sort3- Shell Sort4- Heap Sort PS: Is it heap or sh...
User Avatar
1 votes
1 answer
675
Time complexity
show how to sort n number in the range [0,n^2-1] in O(n)time?
show how to sort n number in the range [0,n^2-1] in O(n)time?
User Avatar
0 votes
1 answer
678
Data structure
What is the running time of the function? Int function(int n) { If(n<=1)return; For(int i=1;i<n;i++); For(int j=0;j<3;j++); Function (n-1);
What is the running time of the function?Int function(int n) {If(n<=1)return;For(int i=1;i<n;i++);For(int j=0;j<3;j++);Function (n-1);
User Avatar
3 votes
1 answer
679
time complexity
$f(n)=2n^2+ n log n$ $g(n)= \dfrac{n}{logn} + log^2n$ then $f(n)\times g(n)$ is: $n^2logn$ $\dfrac{n^3}{logn}$ $n^3log^2n$ $n^2log^2n$
$f(n)=2n^2+ n log n$$g(n)= \dfrac{n}{logn} + log^2n$ then $f(n)\times g(n)$ is:$n^2logn$$\dfrac{n^3}{logn}$$n^3log^2n$$n^2log^2n$
User Avatar
0 votes
1 answer
681
Doubt on Heap
How much time will it take for deleting $i^{th}$ and a number $n(random)$ node from a heap?
How much time will it take for deleting $i^{th}$ and a number $n(random)$ node from a heap?
User Avatar
1 votes
1 answer
682
Time Complexity
Please find the time complexity of the following code:-int i,s1; i=1,s1=1; while(s1<=n) { i++; s1+=s1+i; printf("Hope"); }
Please find the time complexity of the following code:-int i,s1;i=1,s1=1; while(s1<=n) { i++; s1+=s1+i; printf("Hope"); }
User Avatar
3 votes
4 answers
684
ISRO2018-56
The time complexity of computing the transitive closure of binary relation on a set of $n$ elements is known to be $O(n)$ $O(n*\log(n))$ $O(n^{\frac{3}{2}})$ $O(n^{3})$
The time complexity of computing the transitive closure of binary relation on a set of $n$ elements is known to be$O(n)$$O(n*\log(n))$$O(n^{\frac{3}{2}})$$O(n^{3})$
User Avatar
3 votes
2 answers
686
#Graph Theory #Algorithms Self Doubt about Dense Graphs.
Please give some example regarding number of edges in dense graph is - |E| < |V2| I get that when we take log both sides we get O(ElogV), but I can't get this |E| < |V2|
Please give some example regarding number of edges in dense graph is - |E| < |V2|I get that when we take log both sides we get O(ElogV), but I can't get this |E| < |V2|
User Avatar
0 votes
1 answer
687
#Algorithms How is this equivalent in Kruskal's Algorithm's Time Complexity?
Kruskal Time complexity is O(mlog m) then how in upper bound it can be written as - O(m2) ----> How log m = O(m) and O (mn) ---------> How log n = O(n)
Kruskal Time complexity is O(mlog m) then how in upper bound it can be written as - O(m2) How log m = O(m)and O (mn) - How log n = O(n)
User Avatar
Page: