I like to read about new and clever algorithms. And I like to think out of the box, so all kinds of algorithms from all fields of computation are welcome.
From time to time I read research papers to keep up with the current research and expand my horizon. I also like to learn new tricks. Unfortunately I tend to concentrate only on my field of interest, so I miss a lot of usefull stuff.
Let’s just not post mainstream things. Instead write about something special that made you think: ‘Wow – now that’s a clever solution!’.
It’s not something completely new or exciting, but I like the Levenshtein Distance.
The Levenshtein Distance is often referred to as the edit distance between two strings and is basically a metric that measures the difference between two strings by counting the minimum number of operations to convert one string to the other.
I’m using this algorithm to suggest a sorting of a number of strings to match the order of an external source of (possibly different) strings.