Question: Exercise 9 . 8 ( Logarithmic bound ) : Show that T ( n ) = lg ( 1 0 2 4 n ) -
Exercise Logarithmic bound: Show that Tn lg n is lg n by showing that clg nTnclg n for all n Please fill in where I left the thnak you
Tn lg n lg lgn lgn
lgnfor n
for n
So Tnfor n Also, Tn for all n
Enter smallest integer for which this is true so that Tn Tn for all such n Also, lgn for all n Enter smallest integer for which this is true. so that lgn lgn for all such n Thus:
Tnlg n for all n Use the smallest integer in the first blank for which this inequality can be satisfied for all n greater than a certain number. Then in the second blank, substitute either the smallest integer for which it will be true, or the smallest integer that "obviously" results from this proof. Both will be accepted as correct.
So we showed that Tn is Big lg nFill in the blank with O or Omega
Using the above equality from log laws, we could break up Tn into a sum of two terms. Comparing each one individually and then taking the sum, we'd have the following:
lgnfor n
lgn for n Enter smallest integer for which this is true.
So Tnfor n and for all such n we have already shown Tn and lgn so Tnlg n for all such n whereby we have shown Tn is Big n lg nFill in the blank with O or Omega
Combining these results, we have shown that Tn is lg n since:
lg nTnlg n for all N whereby Tn is nlgn
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
