Re:Why xkcd-style graphs are important
by npsimons on Tuesday April 01, 2014 @07:00PM
(#7512376)
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/)
[ Parent
| on HN ]
There are no comments on this comment yet.