3 ms·
There is no way you would be able to estimate throughput without doing any benchmarks.
by baby 7y ago
There is no way you would be able to estimate throughput without doing any benchmarks.
- gwbas1c 7y agoThings like Big-O notation are part of introductory computer science classes and introductory algorithms classes. BigO notation also applies when an algorithm is distributed and runs over a network. An algorithm that's O(n^2) will always be slower than an algorithm that's O(2n). You don't need to run benchmarks to find that out.