I don't know why you were downvoted; it's the same thing in CS. Why else would w...

		npsimons on April 1, 2014 \| parent \| context \| favorite \| on: Why xkcd-style graphs are important I don't know why you were downvoted; it's the same thing in CS. Why else would we reduce all sorts of algorithms to simpler big-O notation other than to convey the more important concepts of complexity tradeoffs in algorithms? Also, Fermi estimation (always relevant: http://what-if.xkcd.com/84/)