Timeline for How meaningful is the Big-O time complexity of an algorithm?
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 17, 2014 at 17:13 | comment | added | Despertar |
+1 for mentioning the rate of growth. If I have a O(1) constant time algorithm, it doesn't necessarily mean its fast. It could take an hour to run. What it implies is that adding more records does not increase the time it takes to run.
|
|
| Apr 10, 2013 at 23:27 | history | answered | user28988 | CC BY-SA 3.0 |