Timeline for How meaningful is the Big-O time complexity of an algorithm?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 18, 2014 at 20:26 | comment | added | BrianH | +1 for even just #1. All too often a quick test case goes "one, three...done, it works!" Then when it sees a realistic use scenario - kaboom | |
| Apr 11, 2013 at 4:54 | comment | added | Martin Beckett | It's also worth thinking of the future. That dir algorithm that worked well in 1995 with 10s of subdirs on a local disk doesn't work so well with 100,000files on a NAS | |
| Apr 11, 2013 at 3:52 | history | answered | joshp | CC BY-SA 3.0 |