Brushing up on C.S. – Part 1: Algorithmic Complexity

This post has moved to my new location, philosopherdeveloper.com:

http://philosopherdeveloper.com/posts/brushing-up-on-cs-part-1-algorithmic-complexity.html

Advertisements

3 thoughts on “Brushing up on C.S. – Part 1: Algorithmic Complexity

  1. svick says:

    I hope that next time, you will introduce a real-world example of O(n log n). 🙂

  2. David says:

    Like! You did explain things in understandable terms. The “greeting” analogy reminded me of the “goodbye” analogy when people leave a family gathering like a wedding and everyone needs to hug everyone else. That happens more, I think, than everyone greeting everyone, because it tends to happen at once, revealing the “algorithmic complexity” of the goodbyes, whereas the hello are spread out and the complexity isn’t obvious.

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 )

Twitter picture

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

Facebook photo

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

Google+ photo

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

Connecting to %s

%d bloggers like this: