Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

3
  • 2
    If you worry about performance, you should advise your compiler to inline the function. Commented Feb 5, 2013 at 12:34
  • 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.
    – gnasher729
    Commented Apr 18, 2016 at 21:39
  • 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. Commented Apr 19, 2016 at 2:32