Register

Cormen chapter 11

511 views
1 1 vote

Are this time complexities right..len=alpha

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Vertical Microprogra...Next → · C PROGRAMMING
← Previous in category · PointersNext in category → · C PROGRAMMING
Position:
Show:

Related questions

2 2 votes
2 2 answers
1.2k
1.2k views
Abhilash Mishra asked Jul 4, 2018
1,215 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 inconsi...
0 0 votes
0 0 answers
541
541 views
BASANT KUMAR asked Mar 26, 2018
541 views
cormen (chapter 3 exercise question no=3.2-8)
Show that $k \ln k = \Theta(n)$ implies $k=\Theta (n/\ln n)$
2 2 votes
1 1 answer
990
990 views
Veeplob Singh asked Jul 22, 2017
990 views
Cormen 3rd edition (Chapter 4 Divide & Conquer)
Refer Cormen 4-3 (j) Page no108Give Asymptotic upper bound of given recurrence using "SUBSTITUTION METHOD" T(n)=n^(1/2) .T(n^(1/2)) +n
0 0 votes
0 0 answers
791
791 views
sushmita asked Dec 6, 2016
791 views
cormen chapter 3
Consider the two functions (logn)k and nϵ, where k>1 and ϵ>0. The solution is (logn)k= O(nϵ). My doubt is that if we take ϵ as0.000000000000000000000000000000.......000...