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

**URL:** <https://forum.devtalk.com/t/a-common-sense-guide-to-data-structures-and-algorithms-second-edition/5596>\
**Category:** PragProg Customers\
**Tags:** book-a-common-sense-guide-to-data-structures-and-algorithms-second-edition, errata\
**Created:** [2 January 2021 22:31 UTC](https://forum.devtalk.com/t/a-common-sense-guide-to-data-structures-and-algorithms-second-edition/5596 "2021-01-02T22:31:16Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![Mark](https://forum.devtalk.com/user_avatar/forum.devtalk.com/mark/32/1238_2.png) [@Mark](https://forum.devtalk.com/u/Mark)\
**Post date:** [2 January 2021 22:31 UTC](https://forum.devtalk.com/t/a-common-sense-guide-to-data-structures-and-algorithms-second-edition/5596/1 "2021-01-02T22:31:16Z")

</div>

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!

---

<div class="post-metadata">

**Author:** ![jaywengrow](https://forum.devtalk.com/user_avatar/forum.devtalk.com/jaywengrow/32/527_2.png) [@jaywengrow](https://forum.devtalk.com/u/jaywengrow)\
**Post date:** [11 January 2021 21:54 UTC](https://forum.devtalk.com/t/a-common-sense-guide-to-data-structures-and-algorithms-second-edition/5596/2 "2021-01-11T21:54:52Z")

</div>

Thanks for this! We’ll try to reword for the next printing.