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
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4, 2023 at 12:08 | comment | added | MSalters | More realistically, define an unbound integer type in C. Even addition will be O(N). Addition is O(1) in machine code only because the number of bits in a register is fixed. | |
| Jul 3, 2023 at 19:17 | history | answered | Inuyasha Yagami | CC BY-SA 4.0 |