Hello, algorithms people,

Gah :( 15 months between newsletters. Erm, well, I was, like, busy working on other stuff so that I’d have something to report when I finally did send out a newsletter? Yes, let’s go with that :D

Algorithmic Thinking, 2nd Edition

I’m happy to report that the second edition of Algorithmic Thinking is available in Early Access now!

You can check out the book

and please use the code PREORDER for 25% off.

I went through every word of the book, making little updates and improvements where ever I could. A lot of this is as a direct result of engaging with my readers. But, I know I know, “what’s the new good stuff?”

OK :)

A whole new chapter on advanced dynamic programming tricks. (I haven’t seen the forward/backward trick described in this much depth in any book, so I hope this is valuable!) Also new stuff on solving problems with more than two dimensions in the dynamic programming array.

A new hash tables problem that I think really exemplifies why hash tables are so powerful.

A whole new chapter on using random numbers to design fast algorithms. Weird, right? But true: randomness can be really effective in certain algorithm situations!

Here’s a LinkedIn post about what’s new and why I wanted to do this update

Algorithmic Thinking Blog

It’s still there! (I need to make a new one for the 2nd edition…)

• Obviously I can’t seem to stop solving problems using segment trees. Let’s be happy that my publisher put a page limit on me :D but here’s another problem that I really liked solving with segment trees. Give it a try!

• Curious about my top algorithm design books? I made such a list. I’ve read each of these multiple times, every word of them. I always try to keep up with the quality of the best books whenever I write (a difficult task!).

Help Getting the Word Out

I appreciate your support of my work (your vote of confidence in buying the book and/or signing up for my newsletter is already more than I could ask for). I’d love to get the book out to more readers, and there’s no substitute for testimonials/reviews from readers of the book. So, if you’re up for more… I’d be grateful for your help; e.g. if you wouldn’t mind posting a personal review on a website like Amazon or Goodreads, or supporting the book through your network for people who may benefit from it.

Thank you as always. Until next time! Dan