The text used to only be available via a PDF. Highly recommend if you're learning about algorithms, might buy a copy myself just to support Jeff (and add my own notes into the book).
For any one hitting the comments without reading it, this book is amazing and is written super well, it’s as if you have a friend explaining the algorithm to you.
This published edition apparently got rid of some content that was in a previous pre-publication draft. I remember thoroughly enjoyed the discussion of treaps and generally using randomization to great effect. That seems to be gone from this edition :( It was always one of my favorite topics to discuss with interviewers when doing coding interviews (if the interviewer is into it of course).
There is a section in the book's page called Director's cut. These are the topics not discussed in the book and mentions treaps, randomized minimum cut etc.
Yes I saw that. I was just questioning the choice of what to cut. For example I don't think I've ever used max flow min cut but it's in the book, yet something quite common like disjoint sets or something deeply interesting like randomization didn't make the cut. As a reader, I would've made different choices.
