News for hackers. Stuff that matters.
Re:A Gentle Introduction to Algorithm Complexity Analysis by dionyziz on Wednesday July 04, 2012 @08:44PM (#4201301)
CLRS has an exceptional introduction to complexity and in fact is an exceptional book on its whole. However, it is not always easy to follow for high school students who don't have a mathematical background, as it tends to get a bit formal. It's the same reason many programmers find it repulsive and wouldn't read past the first few pages. For example, the proof for the Master Theorem is clearly not that easy to follow. That's exactly the reason I wrote this article so that it's complete yet approachable to people without a mathematical background.
Re:A Gentle Introduction to Algorithm Complexity Analysis by yuushi on Wednesday July 04, 2012 @11:36PM (#4201643)
That being said, the section containing the proof is starred if I remember. I imagine most people, even those reading CLRS, skip over it.