News for hackers. Stuff that matters.
Re:The Imposter's Handbook by collyw on Wednesday August 24, 2016 @11:41AM (#12352823)
And many many more where it isn't.

My current work, the problem isn't the algorithms that make the thing run slowly, its because the people who wrote it don't know how to use Django efficiently. Lots of loops in the application making database calls each time (our main page is making over 1000 database calls). A bit more thought in the database design, knowing a bit more about how Django's ORM works and you could do all that work in the database in less than 10 calls and make it a lot faster. A couple of extra database indexes in the right places, and a bit of caching and it should run even faster.

Thats the sort of knowledge that is relevant to (most of) our jobs, not big-o.

Re:The Imposter's Handbook by ryandrake on Wednesday August 24, 2016 @12:24PM (#12353156)
This is exactly true. Even at places where the primary money-making IP is a truly novel application of some algorithm, 99.5% of the code are "supporting actors": an API onto that algorithm, plumbing up through layers of middleware, bindings to other languages/frameworks, integration code to shim it through some legacy system, a CRUD interface, etc. My guess is that Google's search code is actually just tiny island of real computer science surrounded by a vast ocean of plumbing, frameworks and middleware, and that when you're hired there, chances are you're not going to be working on that island.
Re:The Imposter's Handbook by IMTDb on Wednesday August 24, 2016 @11:59AM (#12352950)
"Lots of loops making database calls each time" improved by "a bit more thought in the design" and "a bit of caching" sounds an awful lot like Big O analysis, and algorithmic optimisation even if it is on top on Django ORM.
Re:The Imposter's Handbook by lucasnemeth on Wednesday August 24, 2016 @12:13PM (#12353066)
Sometimes only. big O cuts all the constants and they are really important in actual software development. A lot of actual work involve improving the speed from a 10N to a 2N, it is a big difference for the costumer, but they are all O(N).
Re:The Imposter's Handbook by vonmoltke on Wednesday August 24, 2016 @12:31PM (#12353220)
That's not Big O. Big O is asymptotic complexity. Caching, loop optimization, and the like are irrelevant noise to that calculus.
Re:The Imposter's Handbook by collyw on Thursday August 25, 2016 @04:37AM (#12357632)
Its not really. Its the same algorithmic complexity (the exception being adding appropriate database indexes), but shifting the where the computation is done.