> are still concerned about big-O notation Time complexity is important, and hiring someone who doesn't think so is dangerous. That said, it's important to as

> are still concerned about big-O notation Time complexity is important, and hiring someone who doesn't think so is dangerous. That said, it's important to ask about an algorithm you've already discussed. Asking "what's the big-O of <generic algorithm>" also tests for whether you remember the specifics of that algorithm, which isn't terribly useful.