Weekly goal

I am going to post each week in order to improve my communication skills.

I was looking through anagram algorithms in Ruby today. Which lead me to reading about Knuths solution

‘Knuth: create a key for each word, where the key is that word’s
letters in sorted order. For example, the key for both \beast” and \abets” is \abest”. All words
that share the same key belong to the same anagram set.’

The book ‘Art of Computer Programming, Volume 4, Fascicle 4,The: Generating All Trees’, covers all kinds of interesting maths history.





Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s