On fancy algorithms Fancy algorithms are slow when n is small, and n is usually small. – Rob Pike Source Share this:Click to share on Twitter (Opens in new window)Click to share on Facebook (Opens in new window)Click to share on Google+ (Opens in new window)