Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged cormen
0
votes
0
answers
181
Cormen Edition 3 Exercise 11.1 Question 2 (Page No. 255)
A bit vector is simply an array of bits ($0s$ and $1s$). A bit vector of length $m$ takes much less space than an array of $m$ pointers. Describe how to use a bit vector to represent a dynamic set of distinct elements with no satellite data. Dictionary operations should run in $\mathcal{O}(1)$ time.
A bit vector is simply an array of bits ($0s$ and $1s$). A bit vector of length $m$ takes much less space than an array of $m$ pointers. Describe how to use a bit vector ...
akash.dinkar12
237
views
akash.dinkar12
asked
Apr 4, 2019
Algorithms
cormen
algorithms
hashing
descriptive
+
–
0
votes
1
answer
182
Cormen Edition 3 Exercise 11.1 Question 1 (Page No. 255)
Suppose that a dynamic set $S$ is represented by a direct-address table $T$ of length $m$. Describe a procedure that finds the maximum element of $S$. What is the worst-case performance of your procedure ?
Suppose that a dynamic set $S$ is represented by a direct-address table $T$ of length $m$. Describe a procedure that finds the maximum element of $S$. What is the worst-c...
akash.dinkar12
847
views
akash.dinkar12
asked
Apr 4, 2019
Algorithms
cormen
algorithms
hashing
+
–
1
votes
1
answer
183
CLRS Chapter-22 Figure-22.6
What are the strongly connected components in the above figure ?
What are the strongly connected components in the above figure ?
Doraemon
741
views
Doraemon
asked
Mar 30, 2019
Algorithms
algorithms
graph-algorithm
normal
cormen
+
–
0
votes
1
answer
184
cormen 7.2 -5
Suppose that the splits at every level of quicksort are in the proportion 1 - α to α, where 0 < α ≤ 1/2 is a constant. Show that the minimum depth of a leaf in the recursion tree is approximately - lg n/ lg α ... procede with this problem i had seen stackoverflow solution but couldn't understand https://stackoverflow.com/questions/17684680/maximum-and-minimum-depth-of-quicksort
Suppose that the splits at every level of quicksort are in the proportion 1 - α to α, where 0 < α ≤ 1/2 is a constant. Show that the minimum depth of a leaf in the r...
vijju532
1.1k
views
vijju532
asked
Dec 21, 2018
Algorithms
algorithms
sorting
data-structures
recursion
cormen
+
–
0
votes
1
answer
185
algorithm corman
Insertion sort uses an incremental approach for designing algorithm can someone please explain?
Insertion sort uses an incremental approach for designing algorithm can someone please explain?
saurabh12345
402
views
saurabh12345
asked
Jul 24, 2018
Algorithms
sorting
cormen
algorithm-design
+
–
3
votes
1
answer
186
Coreman :Graph Algorithms
The square of a directed graph G=(V,E) is the graph G2=(V,E2) such that (u,v) ∈ E2 if and only G contains a path with at most two edges between u and v. Describe efficient algorithms for computing G2 from G for both the adjacency-list and adjacency-matrix representations of G. Analyze the running times of your algorithms.
The square of a directed graph G=(V,E) is the graph G2=(V,E2) such that(u,v) ∈ E2 if and only G contains a path with at most two edges between u and v.Describe efficien...
Abhishek Malik
1.3k
views
Abhishek Malik
asked
Apr 16, 2018
Algorithms
graph-algorithm
cormen
time-complexity
+
–
0
votes
1
answer
187
Cormen Exercise
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) ?
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) ?
Ashwani Kumar 2
457
views
Ashwani Kumar 2
asked
Nov 8, 2017
DS
data-structures
binary-heap
cormen
descriptive
+
–
2
votes
1
answer
188
Coreman: Time Complexity
Can you please solve this following question further? What will be the time complexity?
Can you please solve this following question further?What will be the time complexity?
Manu Thakur
1.4k
views
Manu Thakur
asked
Aug 18, 2017
Algorithms
time-complexity
algorithms
asymptotic-notation
cormen
recurrence-relation
+
–
1
votes
1
answer
189
Coreman: Relative Asymptotic growths
Suppose $A = log^{k}n$ $B = n^{\epsilon} $ Assume that $ k\geq 1$ and $ \epsilon > 0$ What is the relation b/w the asymptotic time complexities of A and B? 1. A = O(B) 2. A = o(B) 3. A = $\Omega (B)$ 4. A = $\omega (B)$
Suppose$A = log^{k}n$$B = n^{\epsilon} $ Assume that $ k\geq 1$ and $ \epsilon 0$What is the relation b/w the asymptotic time complexities of A and B?1. A = O(B)2. A =...
Manu Thakur
1.2k
views
Manu Thakur
asked
Aug 14, 2017
Algorithms
algorithms
asymptotic-notation
time-complexity
cormen
+
–
2
votes
1
answer
190
Algo cormen Time complexity
T(n)= C+T(n-1), if n>1 = d, if n≤ 1 What is tme complexity?
T(n)= C+T(n-1), if n>1= d, if n≤ 1 What is tme complexity?
Sandeep Suri
388
views
Sandeep Suri
asked
Aug 1, 2017
Algorithms
recurrence-relation
cormen
+
–
1
votes
0
answers
191
Introduction to Algorithm 3rd ed
I implemented maximum sub-array problem with Divide and Conquer approach in c++ and python. I got little bit of confusion in the implementation.Below are the implementations. I got different results when I change the for loop of both c++ and python code.in ... In first case I am getting right output i.e 43 but in 2nd I am getting 56 as the output! Please help!
I implemented maximum sub-array problem with Divide and Conquer approach in c++ and python. I got little bit of confusion in the implementation.Below are the implementati...
Alabhya Pandey
354
views
Alabhya Pandey
asked
Jul 21, 2017
Algorithms
divide-and-conquer
maximum-sub-array-problem
algorithms
cormen
+
–
1
votes
1
answer
192
corman ex
out of these how many can be solved by master method and how to solve questions in which master theorems cant be applied
out of these how many can be solved by master method and how to solve questions in which master theorems cant be applied
Meenakshi Sharma
272
views
Meenakshi Sharma
asked
Jul 8, 2017
Algorithms
cormen
master-theorem
+
–
1
votes
2
answers
193
Paragraph from Coreman. Can anyone explain me this in simplified manner.
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 simplified way it will be great help.
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 ...
Vishal Upadhayay
600
views
Vishal Upadhayay
asked
Apr 14, 2017
Algorithms
algorithm-design
cormen
descriptive
+
–
0
votes
1
answer
194
cormen
why does radix sort uses stable sort i.e counting sort as an intermediate sorting algorithm?
why does radix sort uses stable sort i.e counting sort as an intermediate sorting algorithm?
shebya nautiyal
431
views
shebya nautiyal
asked
Apr 7, 2017
Algorithms
sorting
radix-sort
cormen
+
–
0
votes
2
answers
195
cormen
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.
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.
shebya nautiyal
422
views
shebya nautiyal
asked
Apr 7, 2017
Algorithms
cormen
sorting
time-complexity
+
–
0
votes
1
answer
196
coremen
what is difference between log*log n and log(log*n)?
what is difference between log*log n and log(log*n)?
shebya nautiyal
261
views
shebya nautiyal
asked
Apr 5, 2017
Algorithms
logarithmic-function
cormen
+
–
0
votes
1
answer
197
cormen
Find T.C T(n)=T(n-1)+1/n; t(n)=constant ifn<=2;
Find T.CT(n)=T(n-1)+1/n;t(n)=constant ifn<=2;
Shashank Kumar Mishr
361
views
Shashank Kumar Mishr
asked
Mar 7, 2017
Algorithms
algorithms
time-complexity
cormen
recurrence-relation
+
–
0
votes
1
answer
198
cormen
prove that if(n)=o(g(n)) if and only if g(n)=Ώ(f(n))? it comes under transitive property
prove that if(n)=o(g(n)) if and only if g(n)=Ώ(f(n))? it comes under transitive property
Shashank Kumar Mishr
797
views
Shashank Kumar Mishr
asked
Mar 7, 2017
Algorithms
algorithms
asymptotic-notation
cormen
+
–
0
votes
2
answers
199
cormen chapter 23 third edition.
Given a graph G and a minimum spanning tree T, suppose that we decrease the weight of one of the edges in T. Show that T is still a minimum spanning tree for G. More formally, let T be a minimum spanning tree for G with edge weights given by weight function w. ... k, if (u, v) = (x, y). Show that T is a minimum spanning tree for G with edge weights given by w'
Given a graph G and a minimum spanning tree T, suppose that we decrease the weight of one of the edges in T. Show that T is still a minimum spanning tree for G. More form...
sushmita
1.6k
views
sushmita
asked
Dec 1, 2016
Algorithms
graph-algorithms
minimum-spanning-tree
cormen
+
–
0
votes
1
answer
200
cormen Q
Given an adjacency-list representation of a directed graph, how long does it take to compute the out-degree of every vertex? How long does it take to compute the in-degrees?
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...
gautamcse27
324
views
gautamcse27
asked
Sep 3, 2016
Algorithms
graph-algorithms
cormen
+
–
1
votes
1
answer
201
Geekforgeeks
Cormen Quicksort Stack depth of quick sort In iterative version of quick sort To reduce the stack size, first push the indexes of smaller half and then use tail recursion for the bigger half What if we push the bigger half into stack and the use tail recursion into smaller half?Plz explain anyone Thankx
Cormen Quicksort Stack depth of quick sortIn iterative version of quick sort To reduce the stack size, first push the indexes of smaller half and then use tail recursion...
Shivangi Verma
319
views
Shivangi Verma
asked
Aug 19, 2016
Algorithms
cormen
quick-sort
recursion
time-complexity
+
–
2
votes
1
answer
202
Cormen page 155
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 full Plz explain this so i get a picture in my head
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...
Shivangi Verma
657
views
Shivangi Verma
asked
Aug 19, 2016
DS
data-structures
tree
cormen
descriptive
+
–
3
votes
1
answer
203
Cormen Edition 3 Exercise 23.2 Question 6 (Page No. 637)
Suppose that edge weights are uniformly distributed over half open interval $[0,1)$. Which algorithm kruskal's or prim's can make you run faster?
Suppose that edge weights are uniformly distributed over half open interval $[0,1)$. Which algorithm kruskal's or prim's can make you run faster?
Pooja Palod
3.0k
views
Pooja Palod
asked
Oct 15, 2015
Algorithms
algorithms
descriptive
cormen
minimum-spanning-tree
kruskals-algorithm
prims-algorithm
+
–
0
votes
1
answer
204
can any1 explain how to find maximum flow in graph from source to sink. pls
indresh
434
views
indresh
asked
Jan 25, 2015
Algorithms
cormen
graph-algorithms
+
–
Page:
« prev
1
2
3
4
5
6
7
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register