3 ms·
You are commenting under blog post that tried to explain it and got it wrong. It is not simple. Examples: - algorithm with O(2^n) complexity might be faster f
by Sankozi 1y ago
You are commenting under blog post that tried to explain it and got it wrong. It is not simple.
Examples:
- algorithm with O(2^n) complexity might be faster for your problem than O(1) algorithm
- the same algorithm may be O(2^n) or O(n³) depending how you define size function
This is not straightforward.
- bongodongobob 1y agoIt is though.
- fxwin 1y agothat's why he said it describes how runtime behaves as input size changes, not how it behaves for specific values