And some people object to testing knowledge of the basics of algorithm complexity analysis with big-O in programming interviews because they "never need that th

And some people object to testing knowledge of the basics of algorithm complexity analysis with big-O in programming interviews because they "never need that theory". IMO complexity analysis is possibly the single most important bit of theory to understand if you work on apps where there is any n which grows to a large number. More important than being able to reverse a linked list or whatever.