Activity
Tyler Mills addressed criticism #4840.
#4840·Dennis Hackethal, 4 days agoThe given algorithm has a complexity, independent of [the implementation]
No, the complexity depends on the implementation.
"Complexity" in the sense of growth behavior with input size? Further reading is still suggesting to me that this is intrinsic to a given algorithm (or class of them). Intrinsic to the math and logic. Implementations can be faster/slower/hungrier for a given input, but if they have different limiting behavior, aren't they different algorithms? I can see how an "implementation" of one algorithm in practice can accidentally change it to another algorithm.