4 ms·
> Big-O assumes that only asymptotic behavior matters, but real-world workloads have finite input sizes Well I did have a CS teacher that said that O(log n) is
by mfost 4y ago
> Big-O assumes that only asymptotic behavior matters, but real-world workloads have finite input sizes
Well I did have a CS teacher that said that O(log n) is basically O(1) because in practice, n usually will fit it in a 32bit and log n then is 32 at most :D
It might have been said in jest in part but really it's not that far fetched.
- sly010 4y agoAnd similarly, very few algorithms are better than O(n), because something as simple as adding 2 numbers can be O(n) where n is the size of the number in bits :)