User contributions
- 16:13, 23 December 2024 (diff | hist) . . (-159) . . 3026: Linear Sort (→Explanation: O(n log n) is never less than O(n), because for this to be the case, log(n) would need to be <1, and because n∈ℕ, the only case this happens is when n=1 ↔ log(n)=0 (assuming the base-2 log which is typical in comp sci))
