3 ms·
> An algo that's O(log n) in the average case but O(2^n) in the worst won't likely find traction. Yes, that's the case for an algorithm. In the case of a busin
by stcredzero 14y ago
> An algo that's O(log n) in the average case but O(2^n) in the worst won't likely find traction.
Yes, that's the case for an algorithm. In the case of a business model, there's a lot of inefficiency that could be turned into profit. (Zipcar)
How about O(n log n) average but O(n^2) worst case?