Skip to main content
Software Engineering

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.

7
  • loop unrolling? All of the above, bar 1, are not really algorithmic optimisations (including loop unroling), more code optimisations Commented Jul 9, 2011 at 2:32
  • +1 - For your (3) memoization could be useful: codebetter.com/matthewpodwysocki/2008/08/01/…, but recursion can be useful, depending on the language. Profile, determine where it is slow, don't just optimize just because you assume that section is slow, it may be slower than optimal but may not overall impact the speed of the program. Commented Jul 9, 2011 at 2:34
  • Well caching could be viewed as a kind of algorithm if use the Wikipedia definition strictly: an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function. The algo here: get the input - find the answer - return. Just minimal:) Commented Jul 9, 2011 at 2:35
  • Your #2 absolutely depends on the used language and is not a general statement. Also depending on the algorithm the iterative implementation may be MUCH more complex (try a cache oblivious matrix multiplication iterative..) and is most certainly harder to parallelize. Commented Jul 9, 2011 at 2:36
  • @Voo Realized my wording is inaccurate and edited. Thanks! Commented Jul 9, 2011 at 2:37