3 ms·
What does sorting have to do with violating p != np? The common bound on sorting is you can't do better than O(n lg n) worst-case, but that is strictly only fo
by kadoban 4mo ago
What does sorting have to do with violating p != np?
The common bound on sorting is you can't do better than O(n lg n) worst-case, but that is strictly only for comparison sorts anyway.
- IAmBroom 4mo agoFor purely randomly distributed groups of n things.