My sister (freshman in college) texted me for Big-O proof help for her Algorithms class saying she's scared CS isn't for her because she doesn't love this class. RT if you don't think about Big-O proofs at your CS job. 

-
Show this thread
-
Replying to @EmilyKager @directhex
Not so much about the proofs. But thinking about runtime behavior is important (from time to time).
2 replies 0 retweets 112 likes -
Replying to @sforkmann @directhex
Yep! Totally agree it's important to learn about complexity, just trying to say that being intimidated by Big-O proofs should not scare people away from CS
4 replies 3 retweets 103 likes -
For algorithms where big O isn't obvious, you need at least proofish reasoning, but almost nobody is called on to do that sort of thing.
1 reply 0 retweets 1 like
Replying to @RichFelker @EmilyKager and
Difficulty of a specialized topic almost nobody needs to do shouldn't be an obstacle to participation in CS.
1:15 PM - 24 Feb 2018
0 replies
0 retweets
1 like
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.