# 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/53599>\
**Category:** PragProg Customers\
**Tags:** book-a-common-sense-guide-to-data-structures-and-algorithms-second-edition, errata\
**Created:** [7 May 2022 01:21 UTC](https://forum.devtalk.com/t/a-common-sense-guide-to-data-structures-and-algorithms-second-edition/53599 "2022-05-07T01:21:48Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![bakatsuyuki](https://forum.devtalk.com/user_avatar/forum.devtalk.com/bakatsuyuki/32/4154_2.png) [@bakatsuyuki](https://forum.devtalk.com/u/bakatsuyuki)\
**Post date:** [7 May 2022 01:21 UTC](https://forum.devtalk.com/t/a-common-sense-guide-to-data-structures-and-algorithms-second-edition/53599/1 "2022-05-07T01:21:48Z")

</div>

Maybe best case of improved Intersection Algorithm perform N2/2 comparisons: A Common-Sense Guide to Data Structures and Algorithms, Second Edition: about 100( A Practical Example, Chapter 6)

Even if two arrays are identical, unless found common values are removed from secondArray, the algorithm performs N2/2 because comparisons each pass-through perform like 1, 2, 3, … N-3, N-2, N-1.

And sorry, I can’t provide the exact page because I read it at [learning.oreilly.com](http://learning.oreilly.com).

 ![スクリーンショット 2022-05-07 9.46.32](https://forum.devtalk.com/uploads/default/original/2X/4/4bbbb25e5c3dd5fc3d4da8310a8e8381dd17e4a2.jpeg)