11 ms·
That's the spirit of those "penis enlargement" ads. To be pedantic, there are hardcore limits on stuff, that we can not improve upon. We cannot sort a list of
by dextorious 15y ago
That's the spirit of those "penis enlargement" ads.
To be pedantic, there are hardcore limits on stuff, that we can not improve upon. We cannot sort a list of n items in less than O(n) for example.
- pork 15y agoO(n) only applies to non-comparison based sorts; for comparison based sorts that might be used on "items" the lower bound is indeed O(n.log n)
- deleted 15y ago[deleted]