|
|
|
|
|
by ajuc
550 days ago
|
|
Compile time fill a lookup table. Run time read 1 value from it. I call it O(1) in time, O(n) in memory. You call it O(1) in both, right? Now move the compile time code to runtime. I call it O(n) in time and memory. What do you call it? If your say O(n) in time and memory - why is moving the code changing its complexity? If you say still O(1) - then everything is O(1), thus proving P=NP among other things :) Either way your interpretation isn't very useful. |
|