198 views
1 votes
1 votes

Are this time complexities right..len=alpha

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
Abhilash Mishra asked Jul 4, 2018
673 views
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...
0 votes
0 votes
0 answers
2
BASANT KUMAR asked Mar 26, 2018
303 views
Show that $k \ln k = \Theta(n)$ implies $k=\Theta (n/\ln n)$
2 votes
2 votes
1 answer
3
Veeplob Singh asked Jul 22, 2017
653 views
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 votes
0 votes
0 answers
4
sushmita asked Dec 6, 2016
428 views
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.........