4 ms·
Is it really that bad? I've taken the time to go back to some great books I never got a chance to fully study, like Udi Manber's Introduction to Algorithms and
by haskellandchill 3y ago
Is it really that bad? I've taken the time to go back to some great books I never got a chance to fully study, like Udi Manber's Introduction to Algorithms and Jeff Erickson's Algorithms and even found some new gems like Guide to Competitive Programming and Competitive Programming 4 Book 1.
- pcthrowaway 3y agoI don't know if this is sarcasm or not, but in case you're serious. The fact that you feel the need to approach this like you're a gladiator preparing for mortal combat in the arena of the mind, is really not OK. Our industry's interviews shouldn't be like this
- haskellandchill 3y agoI used to feel that way but I'm older now and I don't have the energy to fight it. Plus I enjoy studying algorithms so I'm making it work for me.
- asynchronous 3y agoYeah, which is why the young ones are more stressed and depressed then ever.
- thebigspacefuck 3y agoI majored in computer engineering and skipped algorithms so it was pretty intense studying for a couple of months before I felt comfortable. Overall I really enjoyed learning it but I made it through so many successful years of software engineering without learning it that I don’t think it’s relevant to most people. Even now I write an O(n) algorithm to merge sorted lists and people comment on my PR just tell me to throw everything in an array and use the sort function.
- shrimp_emoji 3y agoThe mindfuck when you realize cache locality can make an O(log n) algo faster than an O(1) algo, and the big-O analysis only really matters for extremely large data sets. :D