Register
Webpage for Algorithms

Recent questions tagged algorithms

0 votes
3 answers
1472
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
1 answer
1473
Recurrence Relation
How to solve using recursion tree method T(n) = T(n/2) + c ; n > 1 T(n) = C ; n = 1
How to solve using recursion tree methodT(n) = T(n/2) + c ; n 1T(n) = C ; n = 1
User Avatar
0 votes
1 answer
1474
Uninitialized array with garbage value.
Array follows static memory allocation then why it gives garbage value in case of uninitialized array .and it gives zero when the array is partially initialized?
Array follows static memory allocation then why it gives garbage value in case of uninitialized array .and it gives zero when the array is partially initialized?
User Avatar
0 votes
1 answer
1475
Self-Doubt
User Avatar
1 votes
2 answers
1478
Self-Doubt
What will be the solution of the following recurrence? $T(n)=3T\sqrt{n}+\log(n)$
What will be the solution of the following recurrence?$$T(n)=3T\sqrt{n}+\log(n)$$
User Avatar
0 votes
3 answers
1479
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
1480
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
1481
Gate_2019_Mock_Paper
Please explained in detail hashing question
Please explained in detail hashing question
User Avatar
0 votes
1 answer
1482
Gate_2019_Mock_Paper
Please explained in detail
Please explained in detail
User Avatar
0 votes
0 answers
1483
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
1485
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
3 votes
2 answers
1486
#Algorithms Time Complexity Analysis of Multistage Graph using Bottom Up Dynamic Programming
Time complexity of Multistage Graph is O(n2) or O(V2) but then some people says it's O(E). So, from O(V2) to O(E) are they taking about dense/complete graphs in which number of edges |E| = |V2|? Kindly help!
Time complexity of Multistage Graph is O(n2) or O(V2) but then some people says it's O(E). So, from O(V2) to O(E) are they taking about dense/complete graphs in which num...
User Avatar
7 votes
3 answers
1490
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
1492
merge sort
Why do we say Merge sort makes good use of locality of reference? and if I have $1 \hspace{0.1cm} billion$ elements and my memory can only store $1 \hspace{0.1cm} million$ elements at a time. How would I use merge sort to sort this?
Why do we say Merge sort makes good use of locality of reference? and if I have $1 \hspace{0.1cm} billion$ elements and my memory can only store $1 \hspace{0.1cm} million...
User Avatar
0 votes
1 answer
1499
Finding Min and Max keys
The minimum and maximum number of keys in the internal nodes of B-r with order 4 is: (a) 1, 3 (b) 2, 4 (c) 1, 4 (d) 2, 3
The minimum and maximum number of keys in the internal nodes of B-r with order 4 is:(a) 1, 3(b) 2, 4(c) 1, 4(d) 2, 3
User Avatar
Page: