Suppose we know that an algorithm has n classes of complexity for a problem of size n.
Fantastic news! We've Found the answer you've been seeking!
Question:
Suppose we know that an algorithm has n classes of complexity for a problem of size n. We have
T1(n) = 2, T2(n) = 4, T3(n) = 6 , ..., and Tn(n) = 2n. We also know that the probability of each class is
the same. Find the average complexity of the algorithm.
Related Book For
Managing Controlling and Improving Quality
ISBN: 978-0471697916
1st edition
Authors: Douglas C. Montgomery, Cheryl L. Jennings, Michele E. Pfund
Posted Date: