Difference between revisions of "TADM2E 2.21"
From Algorithm Wiki
(Recovering wiki) |
(No difference)
|
Revision as of 18:14, 11 September 2014
First we should see the dominance relations given in the book as it will help in determining the complexity for cases involving square root of n.
1. True 2. False, sqrt(n) dominates logn. 3. True 4. False 5. True 6. True 7. False
