Timeline for A solution with O(n) time complexity is always slower than a solution with O(nlog(n)) time complexity even though they have the same space complexity
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 8, 2022 at 17:05 | comment | added | Jordi Vermeulen | For problems of any real-world size, log(n) is basically a (pretty small) constant anyway. It can easily be dwarfed by a large actual constant in a different algorithm. | |
| Sep 8, 2022 at 10:18 | history | answered | gnasher729 | CC BY-SA 4.0 |