4 ms·
> soliciting proofs of lower bounds on asymptotic complexity A mathematical proof on the lower bound? is that a common request and something I should prepare
by copperx 11y ago
> soliciting proofs of lower bounds on asymptotic complexity
A mathematical proof on the lower bound? is that a common request and something I should prepare for in an interview?
- pklausler 11y agoIf I ask you whether your sort can be made faster, and you can make a credible case that it's O(n log n), so no, I'm happy.