Register

Cormen 3rd edition (Chapter 4 Divide & Conquer)

• retagged by
674 views

1 Answer

2 votes
2 votes

Time Complexity = O ( n * log(logn) )

sorry for handrwiting and clarity :)

Hope it helps :)

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
3
Abhilash Mishra asked Jul 4, 2018
698 views
Cormen 3rd edition chapter 22 question: 22.4.4
Prove or disprove: If a directed graph G contains cycles, then TOPOLOGICAL SORT $(G)$ produces a vertex ordering that minimizes the number of “bad” edges that are inconsistent with the ordering produced.
Prove or disprove: If a directed graph G contains cycles, then TOPOLOGICAL SORT $(G)$ produces a vertex ordering that minimizes the number of “bad” edges that are inc...
User Avatar
0 votes
0 votes
1 answer
4
Neha_16 asked Apr 27, 2018
5,930 views
Cormen 3rd edition Exercise 4.4.9
Use a recursion tree to give an asymptotically tight solution to the recurrence T(n) =T(an)+T((1-a)n)+cn, where a is constant in the range 0<a<1 and c>0 is also a constant.
Use a recursion tree to give an asymptotically tight solution to the recurrenceT(n) =T(an)+T((1-a)n)+cn, where a is constant in the range 0<a<1 and c>0 is also a constant...
User Avatar
Link Copied!