Recent questions tagged cormen

0 votes
1 answer
182
1 votes
1 answer
183
What are the strongly connected components in the above figure ?
0 votes
1 answer
185
Insertion sort uses an incremental approach for designing algorithm can someone please explain?
0 votes
1 answer
187
Why do we want the loop index i in Line 2 of BUILD_MAX_HEAP to decrease from ceil(A.length/2) to 1 rather than increase from 1 to ceil(A.length/2) ?
2 votes
1 answer
188
1 votes
1 answer
189
2 votes
1 answer
190
T(n)= C+T(n-1), if n>1= d, if n≤ 1 What is tme complexity?
1 votes
1 answer
192
out of these how many can be solved by master method and how to solve questions in which master theorems cant be applied
1 votes
2 answers
193
HI i am trying to understand what author is trying to explain in the below para. However i understood the meaning of Theta(n^2) but if anyone can explain me this para in ...
0 votes
1 answer
194
why does radix sort uses stable sort i.e counting sort as an intermediate sorting algorithm?
0 votes
2 answers
195
counting sort assumes that each of the n input is an integer in the range 0 to k, for some integer k.please explain when k=O(n), the sort run in O(n) time.
0 votes
1 answer
196
what is difference between log*log n and log(log*n)?
0 votes
1 answer
197
0 votes
1 answer
198
prove that if(n)=o(g(n)) if and only if g(n)=Ώ(f(n))? it comes under transitive property
0 votes
1 answer
200
Given an adjacency-list representation of a directed graph, how long does it taketo compute the out-degree of every vertex? How long does it take to compute thein-degrees...
2 votes
1 answer
202
The children's subtrees each have size at most 2n/3 - the worst case occurs when the last row of the tree is exactly half fullPlz explain this so i get a picture in my he...
3 votes
1 answer
203