Timeline for Name for algorithms whose runtime only depends on the problem size?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 13, 2022 at 8:11 | history | edited | ExpressionCoder | CC BY-SA 4.0 |
added 49 characters in body
|
| Oct 13, 2022 at 8:05 | history | edited | ExpressionCoder | CC BY-SA 4.0 |
added 11 characters in body
|
| Oct 13, 2022 at 8:05 | comment | added | ExpressionCoder | @Dmitry Ok fair enough. The suggestion would be my own terminology. I meant constant time per size n, which is a reasonable definition in the context of size based approaches (worst-case, average-case analysis), but is indeed confusing with respect to the traditional definition of an overall constant time (one constant for all sizes). | |
| Oct 12, 2022 at 21:21 | comment | added | Dmitry | Don't know about others, but if someone tells me that $A$ is a "constant-time algorithm", I will 100% understand it as $A$ having $O(1)$ running time. Wikipedia seems to agree: en.wikipedia.org/wiki/Time_complexity#Constant_time | |
| Oct 12, 2022 at 21:17 | history | answered | ExpressionCoder | CC BY-SA 4.0 |