BBECAUSE I CAN’T RESIST
In this appendix, I include additional material related to some of the problems studied in the book. I consider this appendix as optional: it doesn’t concern material that I think is core to the goal of learning about data structures and algorithms. However, if you’re keen to learn more about a problem, this appendix is for you.
Unique Snowflakes: Implicit Linked Lists
It’s often the case that at compile time we don’t know how much memory our program will need. If you’ve ever asked, “How big should I make this array?” or “Will this array be big enough?,” then you’ve experienced first-hand the inflexibility of C arrays: ...
Get Algorithmic Thinking now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
