Title: A Common-Sense Guide to Data Structures and Algorithms, Second Edition

Example: Incorrect time complexity (page 55)

Notice the inefficiency here. As the number of elements increases, the number of steps

grows exponentially.We can see this clearly in the following table:

N Data Elements Max # of Steps

5 20

10 90

20 380

40 1560

80 6320

This is polynomial (quadratic) growth, not exponential!