3 ms·
I 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 dat
by viraptor 10y ago
I 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)