Timeline for Assuming constant operation cost, are we guaranteed that computational complexity calculated from high level code is "correct"?
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 6, 2023 at 0:03 | history | edited | wjmccann | CC BY-SA 4.0 |
added 337 characters in body
|
| Jul 5, 2023 at 8:18 | answer | added | gnasher729 | timeline score: 1 | |
| Jul 4, 2023 at 17:32 | answer | added | J Fabian Meier | timeline score: 0 | |
| Jul 4, 2023 at 15:46 | answer | added | Pablo H | timeline score: 1 | |
| Jul 4, 2023 at 12:14 | comment | added | MSalters | The heuristic for C is typical for a language that compiles to machine code. But the examples of high level languages you give include Python and Java, which don't. Python for instance has to do name lookup at runtime, which is generally not an O(1) operation | |
| Jul 4, 2023 at 7:24 | answer | added | user16034 | timeline score: 2 | |
| Jul 4, 2023 at 2:59 | history | became hot network question | |||
| Jul 3, 2023 at 19:17 | answer | added | Inuyasha Yagami | timeline score: 2 | |
| Jul 3, 2023 at 19:15 | answer | added | D.W.♦ | timeline score: 6 | |
| Jul 3, 2023 at 18:59 | history | asked | wjmccann | CC BY-SA 4.0 |