7 ms·
The article states that Big O notation is used to analyse algorithm complexity and that's correct - it's to analyse the time complexity of an algorithm.
by svisser 12y ago
The article states that Big O notation is used to analyse algorithm complexity and that's correct - it's to analyse the time complexity of an algorithm.
- taeric 12y agoEven then, it is better to say that it is used to compare multiple algorithms on complexity. Also, one of the things I found actually reading TAoCP is that in pretty much all algorithms, he gives a full instruction count of everything. So, it isn't like these preclude each other.
- srdev 12y agoIt can also be used to analyze space complexity. So generically saying "complexity" is also correct.