Timeline for Declaring functions in order to avoid explicit nested loops
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 19, 2016 at 2:32 | comment | added | Loren Pechtel | O(n^6) Wow! I'd like to see how someone managed to accomplish that! I've once written an O(n^8) but I had no choice--I was validating a dataset to ensure there were no dead ends. Given the sparseness of paths through it it only took overnight. | |
| Apr 18, 2016 at 21:39 | comment | added | gnasher729 | That doesn't help much if someone manages to change O (n) to O (n^6). And both with gcc and Clang I have found situations where a really performance critical inner loop ran significantly faster when inlining was prevented. | |
| Feb 5, 2013 at 12:34 | comment | added | Martin Schröder | If you worry about performance, you should advise your compiler to inline the function. | |
| Feb 5, 2013 at 0:00 | vote | accept | BdT. | ||
| Feb 4, 2013 at 14:59 | history | answered | Karl Bielefeldt | CC BY-SA 3.0 |