3 ms·
While I don't think you should know how to implement bubble sort on the fly in an interview, you should probably understand what it is at a conversational level
by joeax 10y ago
While I don't think you should know how to implement bubble sort on the fly in an interview, you should probably understand what it is at a conversational level, along with merge sort and quick sort, especially if the position is senior or lead and requires a CS degree.
- viraptor 10y agoI think that's just a bad substitute for the real question: What's the big-O notation, how do algorithms differ based on the CPU / memory usage and existing data format. Nobody uses merge/quick sort as originally defined anyway. In reality it's going to be some mix of algorithms with a threshold. So why not ask what you really mean by either asking the theory (big-O), or real world practice (you're adding a number to a large ordered data structure - how would you do that, what's the chosen structure, tradeoffs)