Algorithms

Flashback to my time at university. The Sedgewick was the most popular algorithms book among students, being both cheaper and translated to German. Myself, I was using the CLRS Introduction to Algoritms.

This book was found when we were rummaging through stuff that was going to be thrown away at work, and I couldn’t let that happen. I could have used it last week when I was implementing patricia tries. Why is there no good C implementation of them on the ‘net? Anyhow, the question of how to delete an element from a patricia trie isn’t addressed in Sedgewick, so it wouldn’t have helped. I found out, so it wasn’t important, but still, you look up one thing in a classic like this and it’s not in there? How sad.

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.