Register
Webpage for Algorithms

Recent questions tagged algorithms

0 votes
0 answers
1111
IIT Delhi
User Avatar
0 votes
0 answers
1112
#self_doubt
no of max heaps possible with nos given as 1,2,3,4,5? I am getting 8 if you get more please upload solution and do not give direct answers!
no of max heaps possible with nos given as 1,2,3,4,5?I am getting 8 if you get more please upload solution and do not give direct answers!
User Avatar
0 votes
1 answer
1115
MadeEasy Test Series: Algorithms - Time Complexity
For merging two unsorted list of size m and n into sorted list of size (m+n). The time complexity in terms of no. of comparison for this is?
For merging two unsorted list of size m and n into sorted list of size (m+n). The time complexity in terms of no. of comparison for this is?
User Avatar
4 votes
2 answers
1116
T(n) = sqrt(n) * T(sqrt(n)) + n
T(n) = sqrt(n) * T(sqrt(n)) + n Given solution is O(log log n). But my solution is O(n log log n). 'wolframalpha'' shows the answer same as mine. You can find the solution here. Can anyone confirm the solution and provide an explantion?
T(n) = sqrt(n) * T(sqrt(n)) + n Given solution is O(log log n). But my solution is O(n log log n).'wolframalpha'' shows the answer same as mine. You can find the solution...
User Avatar
0 votes
1 answer
1117
BFS TRAVERSAL
HOW CAN WE GET A CROSS EDGE WHILE PERFORMING A BFS ON UNDIRECTED AND DIRECTED GRAPH CAN ANYONE SHOW WITH AN EXAMPLE?
HOW CAN WE GET A CROSS EDGE WHILE PERFORMING A BFS ON UNDIRECTED AND DIRECTED GRAPH CAN ANYONE SHOW WITH AN EXAMPLE?
User Avatar
0 votes
1 answer
1118
best algo to sort 1 million item
what is the best algorithm to sort a list of more than 1 million items in an array a)quicksort b) merge sort c)heap sort d) bubble sort
what is the best algorithm to sort a list of more than 1 million items in an arraya)quicksort b) merge sort c)heap sort d) bubble sort
User Avatar
0 votes
0 answers
1119
What will be Final Content of Array
User Avatar
–1 votes
0 answers
1120
ace book
how to find value in this type of question???
how to find value in this type of question???
User Avatar
0 votes
1 answer
1121
madeeasy
how to apply masters theorem in this type of cases!????!
how to apply masters theorem in this type of cases!????!
User Avatar
0 votes
0 answers
1122
Shortest Path
User Avatar
0 votes
1 answer
1124
recurrence relation
T(n)=5 T ($\frac{n}{2}$+16) + n2 please tell the solution as i m getting confused
T(n)=5 T ($\frac{n}{2}$+16) + n2please tell the solution as i m getting confused
User Avatar
0 votes
2 answers
1125
METest_Algo
I think the past cost to G from A as computed by Dijkstra should be 2 instead of 8. Please help me verify it.
I think the past cost to G from A as computed by Dijkstra should be 2 instead of 8.Please help me verify it.
User Avatar
0 votes
2 answers
1126
selfas
f(n) + O(f(n)) = Θ(f(n)) True or not? Explain please
f(n) + O(f(n)) = Θ(f(n))True or not? Explain please
User Avatar
0 votes
0 answers
1127
Made Easy Algorithms Test - 2
https://gateoverflow.in/?qa=blob&qa_blobid=8164680937983732221 I don't understand the solution at all. I thought 91,33,44,and 77 can come in any possible ways but that has been said wrong.
https://gateoverflow.in/?qa=blob&qa_blobid=8164680937983732221I don't understand the solution at all. I thought 91,33,44,and 77 can come in any possible ways but that has...
User Avatar
0 votes
0 answers
1129
Time Complexity
How to solve the following recurrence relation? T(n) = T(n-6) + n2 , n>7 T(n) = 1 , n<= 7
How to solve the following recurrence relation?T(n) = T(n-6) + n2 , n>7T(n) = 1 , n<= 7
User Avatar
0 votes
0 answers
1130
TIME COMPLEXITY
n is prime ,find value of x and find time complexity. main() { x=0; for(i=1;i<=n;i++) { if(n%i) { for(j=1;j<=n;j=j*10) { x=x+1; } } } } what i am getting is x=(n-2)logn tym complexity =n+(n-2)log n. is correct ?
n is prime ,find value of x and find time complexity.main(){x=0;for(i=1;i<=n;i++){if(n%i){for(j=1;j<=n;j=j*10){x=x+1;}}}}what i am getting is x=(n-2)logntym complexity =n...
User Avatar
0 votes
0 answers
1132
GATEBOOK_DSA5_7
Which of the following provides a lower bound on the number of comparisons needed to find the kth largest element in an array of n integer elements? (A) n ∗ k (B) n + k − log n (C) min (n + k − 1, 2(n − k + 1)) (D) n − 1 + min (k − 1, n − k)
Which of the following provides a lower bound on the number of comparisons needed to find the kth largest element in an array of n integer elements?(A) n ∗ k (B) n + k ...
User Avatar
1 votes
1 answer
1138
What is the value of T(n) for the given recurrence relation
T(n)=T(n/2)+2; T(1)=1 when n is power of 2 the correct expression for T(n) is: a) 2(logn+1) b) 2logn c)logn+1 d)2logn+1
T(n)=T(n/2)+2; T(1)=1when n is power of 2 the correct expression for T(n) is:a) 2(logn+1)b) 2lognc)logn+1d)2logn+1
User Avatar
2 votes
0 answers
1140
Connected Components
User Avatar
Page: