0

The time complexity for some algorithm is $T(n) = 2^n$ where n is the size of inputs. A particular computer takes t seconds to process n inputs. How many inputs can a computer that is 64 times as fast process during the same time t?

How would an equation be set up to solve this?

lawls
  • 461
  • 2
  • 7
  • Do you mean it takes $t$ seconds to process an input of size $n$? And then the question is what size can be handled in $t$ seconds by the faster computer? – André Nicolas Sep 08 '15 at 05:56

1 Answers1

1

Find $n'$ with $$ T(n')=64T(n).$$

Hagen von Eitzen
  • 374,180