3.11 Suppose, for some method, worstTime(n) = nn. Show that the method is an exponential-time method (that is, worstTime(n) is !(xn ) for some real number x >1.0). But show that worstTime(n) is not "(xn )-that is, Big Theta of xn-for any real number x >1.0. | |
| View Solution | |
| << Back | Next >> |